8. Let A be a two-dimensional array. The address o1980 A [2][3] is 1932. Assume that each element of A occupies two bytes. (10%) (a) Please find the address of A[o][o] (b) Please find the address of A[6][1] Please answer the following short question about tree. (35%) (a) What is the maximum number of nodes on level 1 of a binary tree? (b) What is the maximum number of nodes in a binary tree of depth k? (c) For a fully complete binary tree T, let no be the number of leaf nodes 9. and n2 the number of nodes of degree 2. What is the relationship between no and n2? (d) What is the depth of a fully complete binary tree with n nodes? (e) How many null links do we have in an n-node binary tree of linked representation? the in-order sequence is [2,4,3, 1,6,5, 7] and the in-order sequence is [7, 4, 2, 1,5,3,6]. (g) Draw the binary tree if the post-order sequence is [7,4,2,5,6,3, 1