Q1 . Let G be a connected planner graph with 10 vertices.if the number of edges on each face is three then the number of edges in graph G is _____
A 24 B.20 C.32 D.64
Q2. Let "a(n)" represent the number of bits of length n containing two consecutive 1s what is the recurrence relation of "a(n)"?
A. a(n-2) + a(n-1) + 2^n-2
B. a(n-2) + 2a(n-1) + 2^n-2
C. 2a(n-2) + a(n-1) + 2^n-2
D. 2a(n-2) + 2a(n-1) + 2^n-2
Q2 i am getting Option A