Question $3(3$ points$)$ Recall that $($i$)$ a complete binary tree is a binary tree in which all levels are completely filled except possibly the last one, and the last level has all nodes as far left as possible, $($it$)$ a full binary tree is a type of binary tree in which every node has cither $0$ or $2$ children, and $($li$)$ a perfect binary tree is $2$ binary tree in which all interior nodes have two children, and all leaf nodes$-$ are at the same level. What is the minimum and maximum number of nodes in a $($a$)$ complcte binary tree of height h$?($b$)$ perfect binary tree of height h$?($c$)$ full binary tree of height h$?$ Question $4(5$ points$)$ Is the function $[$log log n$]!$ polynomially bounded$7$ If so$,$ specify the polynomial that is bounding the function Note: We say. f$($n$)$ is polynomially bounded if $/($n$)$ $ g$($n$)$ where g$($n$)$ is a polynomial of any degree.