I would be glad if you could also explain what you complete the code, thanks :)

(For question parts (a) and (b) below make sure that you fill in only those parts of the program denoted by dotted intervals and that you don't insert additional program lines!) (a) Fill in the blanks in the program below so that it computes the number of nodes with precisely 2 children in a binary tree with the root node pointed by t and stores 1 th in count. void countFull(TreeNode T>, int count) \{ (b) Fill in the blanks in the program below 80 that it computes the number of leaves of a binary tree with the root node poiated by t and stores it in count. void countFull(TreeNode T+ th int count) \{ if(t !=) \{ ij( t> Left() ... t> Right() ... count+r; countFull countFull