A complete binary tree of N elements uses array positions 1 to N

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 (in terms of N, last
3 answers are in terms of big-Oh) must be for the following (fill in the answers in the right column
below)
A binary tree that has two extra levels (that is, it is slightly unbalanced)
A binary tree that has a deepest node at depth 2 logN
A binary tree that has a deepest node at depth 4.1 log N
The worst-case binary tree
Options: N, N1.5, N2, N4.1, 4N, N2.5, 2N, N0.5, 4N