- A B C D E F G H 1 J A 0 1 . 00 0 001 00 Do 1 0 00 0 A 0101000000 B 0 0 1 0 1 0 0 0 0 0 C 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 E 0 0 0 0 0 0 1 1 0 0 F 0 0 0 0 0 0 0 0 0 0 G 0 0 0 0 0 1 0 0 0 1 H0 0 0 0 1 0 1 1 0 0 0 10 00 0 0 0 0 0 0 0 0 0 H 00 1 1 I 00 0 0 0 1 0 1 0 1 J J 0 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]