J Oo A B C D E F G H I A 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 00 c0000001000 C 0 0 0 0 0 0 1 0 D01100 D 0 1 1 0 0 0 0 0 0 0 E 0 0 0 0 0 0 0 0 FOOOO000000 F 0 0 0 0 0 0 0 0 G00000 10001 H0 0 0 0 0 1 1 0 0 0 1 000 00 1 1 0 000 0 0 0 0 0 0 I 0 1 0 0 a. Given the above adjacency matrix: Draw the equivalent adjacency list. [2] Hi, Draw the equivalent graph [2] ill. 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. mult, null nul. GJ, null Draw the binary tree, 21 Write the precircles and post-order traversal sequence of the tree 121 1. Convert the tree to a complete binary tree. [1]