the following: - The left subtree nodes less than the node's key, i.e., (the root). - The right subtree nodes greater than the node's key, i.e., (the root). - The left and right subtree each must also be a BST. Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. Here is a list of depth first traversal methods: (a) Inorder (Left, Root, Right):, (b) Preorder (Root, Left, Right), Postorder (Left, Right, Root). Write a C program that you implement BST representation using data provided in an input text file using the command line arguments. Check the provided BST node structure. Your program should read input file to form a BST, display BST nodes in Inorder and return kth largest element(s) in the BST. You should run your code as follows: ./q1 data1.txt 5 ./q1 data1.txt 5811 (a) [10 Points] Write a C function(s) to read input data (unsorted) from an input data file to form a BST. Note that data can be assumed as 'double' type but the number of entries in each file is unknown, and hence to be read dynamically until EOF (End of File) is reached. (b) [10 Points] Write a C function display the elements using inorder traversal method, i.e., in sorted order from minimum to maximum value (no duplicates). (c) [15 Points] Write a C function to find the kth largest element in the BST, where k is also a variable to be read using command line arguments. Here is an algorithm. [-] Find the reverse of inorder traversal of the binary search tree. [-] Keep track of the count of nodes visited while traversing. [-] When the count of the nodes becomes equal to k value, return the node. (c) [5 Points] Complete the main() to process command line arguments, and print the outcomes as in sample runs, (make sure to match the format of your outputs with