Create a program in C use binary search tree.

Write a menu based program to maintain student records. Your program should take the following inputs: 1. Student ID (any value between 1000 to 1100)- NO DUPLICATES 2. Student first name (max. 20 characters) 3. Student last name, (max. 20 characters) 4. Student scores (float/double), eg. 85.4 5. Zip code (may be a string) You have to create a structure Student with above information. Then create a Binary Search Tree where each node in the BST contains a Student Notel: Student ID (left child)