I got a java test done and somehow my answer for this question is incorrect, can you guys help me explain it?

So the question is: in a binary tree with height 3 the least deep leaf has depth 2 (Root has depth 0).

a)Max numbers of nodes this tree can have?

b) Min numbers of nodes this tree can have?

My answer is 7 and 4, yet my professor said it should be 13 and 5