3.5 Tree Code. Be sure to fully test and document all of your code. A. Write a program to store a tree as an array. In your test program, be sure to print the array values, and to print the values in tree "format B. Write a function to add an element to an existing tree. C. Write a function to delete an element from an existing tree. D. Write a function to perform an "in-order" traversal on an existing tree. E. Write a function to perform an "pre-order traversal on an existing tree F. Write a function to perform an "post-order traversal on an existing tree. G. Write a function to perform an "level-order" traversal on an existing tree. H. Write a function to find the children of a specified node. I. Write a function to find the parent of a specified node. 3.6 Re-write the functions above using a vector from the + library