Question 3 A B C D E F G H H 1 J A 0 1 0 1 0 1 E 0 0 0 0 10 0 0 000 B010 B 0 0 1 0 1 0 0 0 0 0 Co C 0 0 0 0 0 0 1 0 0 0 000 00 000 Do D 0 1 1 0 0 0 0 0 0 0 11 00 E DOO 0 0 1 1 0 0 0 0 00 F 0000000000 G 0 0 0 0 0 1 0 0 0 1 10 00 00 0 0 0 0 0 1 1 0 0 0 000 1 0 0 0 0 0 1 0 1 0 1 0 0 1 H 0 0 1 I 0 0 0 0 0 0 1 J 0 0 0 0 0 0 0 0 0 a. Given the above adjacency matrix: i. Draw the equivalent adjacency list. [2] ii. Draw the equivalent graph. [2] iii. Calculate the indegree and outdegree of each vertex of the graph. [1] b. Given the array representation of a binary tree [null value means the node is empty]: [null, A, E, H, D, null, B, F, I, C, null, null, null, G, J, null] i. Draw the binary tree. [2] ii. Write the pre-order and post-order traversal sequence of the tree. [2] iii. Convert the tree to a complete binary tree. [1]