please answer quickly and clearly. ill upvote right away! please answer all parts, thank you!

If height of a complete binary tree is 6, the minimum number of nodes possible is? 0 64 31 O 32 24 After the following loop terminates p = start; while(p != NULL) p=p->link; Pointer p will: point to first node of the list O point to last node of the list O point to the second last node Obe NULL