bestion 3 D F 1 | | | | | |1 | . | | | . | 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 0 0 1 0 1 0 0 0 0 0 c000000 1000 D 0 1 1 0 0 0 0 0 0 0 E 0000001100 F 0 0 0 0 0 0 0 0 0 0 G 0 0 0 0 0 1 0 0 0 1 H 0 0 0 0 0 1 1 0 0 0 0 0|0||0|1|0|1| 0 0 0 0 0 0 0 0 0 0 C-I 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] ii. Convert the tree to a complete binary tree. [1] 0 1 0