Refer to the following two graphs for the sub-questions in number 5.

a) Are the graphs isomorphic? Prove your answer by defining and comparing the vertices and edges of both graphs. If they are isomorphic, state which nodes and edges are equivalent.

b) Which graph is a bipartite graph?

c) Which graph is a cycle graph?

d) Which graphs is a wheel graph?

5. Refer to the following two graphs for the sub-questions in number 5.[7 marks] 4 a) Are the graphs isomorphic? Prove your answer by defining and comparing the vertices and edges of both graphs. If they are isomorphic, state which nodes and edges are equivalent. b) Which graph is a bipartite graph? c) Which graph is a cycle graph? d) Which graphs is a wheel graph? 6. Determine whether or not the following are true and provide a full derivation explaining your answer. The domain of the functions of n below is the positive real numbers. For convenience, you may assume that the logs are in the base of your choice, but you should specify what base you are using in your derivation. [6,3,3,3,3 marks a. (12n - 8)2 is 0(n2) b. 8n2 -2 is O(n) 11 log(n+2 is O(n2) d. 36n2 - 13n is 2(logn) e. log(+ n-) is O(n) C. 7. Suppose you know that an element is known to be among the first four elements in a list of 32 elements. Would a linear search or binary search locate this element more rapidly? 1 mark