Note$-$ if you give wrong answer i will give multiple dislikes $.$ program. Please don't copy and paste other solutions in CHEGG. Thanks Task $1$: Please create Look$-$

up$()$ and Insert$()$ functions for Binary Search Tree examples in attached supplement $($Attach Snipping

Photos of Source Code Below$)$ Optional $-$ Implement example $1.$ Build$123()$ from attached supplement

by calling newNode$()$ three times, and using three pointer variables by calling newNode$()$ three times,

and using only one pointer variable by calling insert$()$ three times passing it the root pointer to build

up the tree A$.$ B$.$ C$.$ Task $2$: $2.$ Please implement size$()->$ Problem demonstrates simple binary tree

traversal Task $3$: $3.$ Please implement maxDepth$()$ Given a binary tree, compute its "maxDepth" $--$ the

number of nodes along the longest path from the root node down to the farthest leaf node. The

maxDepth of the empty tree is $0,$ the maxDepth of the tree on the first page is $3$ int maxDepth$($struct

node$*$ node$)\{$ Task $4$: $4.$ Please implenment minValue$()$ Given a non$-$empty binary search tree $($an

ordered binary tree$),$ return the minimum data value found in that tree. Note that it is not necessary to

search the entire tree. A maxValue$()$ function is structurally very similar to this function. This can be

solved with recursion or with a simple while loop int minValue$($struct node$*$ node$)\{$ Task $5$: $5.$ Please

Implement printTreel$)->$ Problem demonstrates simply binary tree traversal Given a binary search tree

$($aka an "ordered binary tree"$),$ iterate over the nodes to print them out in increasing order. So the

tree... $4$ Produces the output $"12245".$ This is known as an "inorder" traversal of the tree Hint: For

each node, the strategy is: recur left, print the node data, recur right. void printTree$($struct node ${?}^{**}$ node$)$ NOTE$-$ IF YOU GIVE WRONG ANSWER $,$ I WILL GIVE MULTIPLE DISLIKES.