Assuming root at height 1
Since maximum elements in a tree (complete binary tree) of height l will be (2^l)-1 so a good array size must be that (since a binary tree node may not always have 2 children but for safety we should take it).
Therefore, none of your answer is correct it should be (2^l) -1