3) The class definition of a BINARY TREE class is given below. It contains an attribute called root that represents the root of a tree. It has a constructor that sets the root to NULL. There are also other methods that manipulates the tree. These methods are findLongestLength(), NumOfNodesDivisibleBy3(), searchForAnElement () and printPreOrder(). The constructor is already implemented. You are required to implement the other four methods. #include #include using namespace std; 11--- class Node; typedef Node* NodePtr; class Node public: int NodePtr left; NodePtr right; Node (0{number =0; left = right= NULL;} Node (int n) { number = n; left = right = NULL;} 3: 11-- number; class tree public: NodePtr root; tree() (root NULL;}; int NumOfNodesDivisibleBy3 (NodePtr root); int findLongestLength(NodePtr root); int searchForAnElement (NodePtr root, int key); int printPreOrder(NodePtr root); 3: 1-- Note: Please answer the question on the next page. All routines MUST be implemented recursively

Q-10)

QIVA) Using asterisk (*) pattern to write a program in C+ to display such below style: ***

Convert from C to C++ .Thank you. / include all required libraries#include<stdio.h>#include<stdlib.h>#include<sys/types.h>#include<sys/wait.h>#include<unistd.h> // variable to store number of generationsint num_generations; // function to print the generationsvoid printGeneration(int n){// stop if number of generations are reachedif(n>num_generations)return; // create a forkpid_t p = fork(); // generate new generationsif(p==0)printGeneration(n+1);else if(p>0)wait(0); // wait until child process terminates // print the present generationif(p!=0){// if n is 0if(n==0)printf("Parent. "); // print parent// if n is 1else if(n==1)printf("Child. "); // print child// for all other caseselse{// print grandchildrenfor(int i=0;i<n-2;i++)printf("Great ");printf("Grandchild. ");}// print pid and ppidprintf("pid: %d ppid: %d\n",getpid(),getppid());}} // main functionint main(int argc, char* argv[]){// if no arguments are providedif(argc==1){// print...

Can I get help writing out this in C++