24. A binary tree can be described as a one dimensional array which level-wise retains all nodes from the root. Consider the following 1-D array as a binary tree and the following statements. (a) If the root is at level 0, the height of the binary tree is 3 (b) The left-child of A[i] is A[2i-1] (c) Post-order traversal of the tree (left-node first): H,U,S,A,N,G,I,O,K (d) In-order traversal of the tree (left-node first): H,A,S,U,K,N,I,G,O (e) The average search complex of such binary trees is O(n) Which of the above statements is CORRECT? (A) (a)(b)(d) (B) (b)(c)(d) (C) (a)(c)(d) (D) (a)(c)(e) (E) (a)(b)(c)(d)(e)