z R 10 10 0 L 0 M 0 0 0 Z KLMNOPS RA z 0 1 0 0 0 0 0 1 0 0 K 0 0 1 0 1 0 1 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 M00 0 0 0 1 0 0 0 0 0 N 0 0 0 0 0 1 1 0 1 0 00000000000 P 0 0 0 0 0 1 0 1 1 0 s 0 0 0 1 0 0 0 0 0 0 R|0|0|0|0|0|0|0|0|0|1 A 0 0 0 0 0 0 0 N 0 0 0 0 0 0 1 0 00 0 00 00 1 A 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, Z, K, M, null, L, O, P, null, null, S, null, null, R, N, AJ i. Draw the binary tree. (2) ii. Write the pre-order and in order traversal sequence of the tree. [2] ii. Convert the tree to a complete binary tree. [1]