5. (10pt) Binary Search Tree (BST)1 You are asked to implement the following function: void copyBSTintoArray (nodeT t, int array])which copies the values Irom a given BST into an array such that the values in the array will be sorted For example, after passing any of the following BSTs into your function, the array should have (3, 5, 6, 7,9) t1 t2 typedef struct node 6 5 int key: struct node left, right , nodeT, treeT; 7 7 int index=0; 5 9 6 9 Before calling your function, assume that we count the number of values in the BST and accordingly allocate enough memory for the array. So you can safely assume that the array in your function has enough space to store all the values in the given BST. Also as a hint, we defined a global variable index and set it to zero before calling your function. void CopyBSTintoArray (nodeT *t, int arrayt)