Create a C program that implements binary search tree. Your program should prompt a menu with 4 options of operation which are insertion, deletion, display and exit. Whenever each operation is completed, it will continuously display the menu. Figure below shows the example of how your program should be.

5 1. Insertion 2. Deletion 3. Display 4. Exit Please insert your selection: 1 Please insert how many numbers: Please insert number 1: 15 Please insert number 2: 18 Please insert number 3: 1 Please insert number 4: Please insert number 5: 5 9 1. Insertion 2. Deletion 3. Display 4. Exit Please insert your selection: 3 The elements inside the tree are: 1 6 9 10 15 1. Insertion 2. Deletion 3. Display 4. Exit Please insert your selection: 2 Please insert the number to delete: 10 1e has been deleted: 1. Insertion 2. Deletion 3. Display 4. Exit