The recurrence relation capturing the optional execution time of the Towers of Hanoi problem with $$n$$ discs is

Let G be a simple undirected planner graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

Consider the function $$f\left( x \right) = \sin \left( x \right)$$ in the interval $$x \in \left[ {\pi /4,\,\,7\pi /4} \right].$$ The number and location(s) of the local minima of this function are

Which of the following graphs is isomorphic to