In C language not C++ or C#, please stick with requirements, thanks!
Write a C program that follows these requirements: 1. Declare a struct Node for the Binary Search Tree. The node should have three fields for the data part: int IBAN, char Customer_Name[30] and float Balance, and two point- ers for the children (left and right). One of the IBAN's should be the AUM-ID of the student and customer name the real name of the student. [5 points] 2. Write a recursive function that inserts nodes in the binary search tree, and use the IBAN as key. [10 points) 3. In the main, ask the user how many customers he/she needs to enter, get the data fields, and call the function you wrote in part 2) to insert the nodes to the BST. [5 points) 4. Write 3 functions that print all the information (data fields for all nodes) in the Tree in InOrder, PreOrder and PostOrder. [5 points] CE264 Advanced C Programming Page 2 of 3 5. In the main, call the functions you wrote in part 4. 12.5 points) 6. Write a recursive function that returns the sum of all the balances available at the bank. [10 points) 7. Call this function in the main, then print the sum. (2.5 points] 8. Using the sum you got in part 7), calculate the average balance value and print it (no need to create a function for this). [2.5 points] 9. Write a function that prints the name of the customer with the smallest IBAN number. [5 points) 10. Write a function that prints the name of the customer with the highest IBAN number. [5 points) 11. Write a function that prints the IBAN the summation of digits of which is the largest in the BST and prints the result along with the customer's name.[5 points] 11. Write a function that prints the IBAN the summation of digits of which is the largest in the BST and prints the result along with the customer's name.[5 points] 12. Write a function that searches for an IBAN number in the BST and prints a relevant message. The IBAN number is to be given by the user during run-time.[5 points] 13. Print the number of nodes in the Tree by using recursion. [2.5 points] 14. Add randomly (per program execution) the IBANs in an array and apply bubble sorting to sort them. Print the result in the console. [7.5 points] 15. Explain theoretically how we would delete a node with two children in a BST and pro- vide a model coding example by providing screenshot of output - it can be either a standalone example or you can apply it on the above exercise.[5 points] 16. Provide a real-world problem that trees are applied. Then provide the correspondent C code.[7.5 points) 17. Design a flowchart that shows all the steps for the above coding question? Explain what is the difference between schematic design and flowchart design? [15 points]
