Pleaee help. Full answer please

1. A regalar binary tree is a binary tree nbose intemal noden kne eucthy two whene. White recunite functions to compute the folloning attributes of a regolar binary tree; thow be tract of ececutice of each fuestion on the following tree. Ansme that you have a Booleta flaction tat tella you whether a node is a leaf a. The number of leares in the tret. b. The number of ares in the tree. c. The eumber of nodes in the tree. 1. The beight of the tree (i.e. the longent diatance from the root to asy ina?) of execution on the sample tise. int internaikodes (treeType t ) (if leat (t) (return 0; ) else (return 1+interaikiodes (t.left) +interaalNodes (t.right) all Trace of ecocition internaiNodes (A) 1+ internaiNodes (B) + internaiNodes (C) 1+1+ internalNodes (D) + internalNodes (E) + +1+ internalNodes (P), InternalNodes (G) 1+1+0+ interaa1Nodes (E) + +1+0+0 1+1+0+1+1 aterna1Nodes (B)+ internaiNodes (I) +1+0+0 =1+1+0+1+0+0 +1+0+0 -4