A complete binary tree of N elements uses array positions 1 to N. Suppose we try to use an array representation of a binary tree that is not complete. Determine how large the array must be for the following:

a. a binary tree that has two extra levels(that is, it is very slightly unbalanced)

b. a binary tree that has a deepest node at depth 2longN

c. a binary tree that has a deepest node at depth 4.1longN

d. the worst-case binary tree