Write a Skip List in C

Create an implementation of a skip list in C that allows for non-unique (meaning you can have multiple of the same number) non-negative integer keys. Your tree will only store keys, no associated data. Implement all 7 dictionary operations: - Insert a given key, return key value, -1 if unsuccessful (run out of space). - Delete a key (all nodes with the given key), return number of nodes deleted. - Search for a key, return 1 if found, 0 otherwise. - Min, Max: Return the minimum/maximum key in the tree. - Successor/Predecessor: Given a key that exists in the tree, return the next bigger/smaller key in the tree. Return -1 if the given element is the biggest/smallest in the tree, or if the given key cannot be found in the tree. - Height: the height of an empty tree will be -1. Due to the multiple ways you can handle non-unique keys, your height may vary. Your program should be able to parse input provided in the standard input, each line of which performs one dictionary operation. Each line has one directive and potentially one key (dependent on the operation), separated by a single space character. You can assume that the input has no errors. The directives are: INS: Insertion DEL: Deletion SEA: Search MIN: Minimum MAX: Maximum PRE: Predecessor SUC: Successor HEI: Tree height Example input file: INS 45 INS 31 INS 45 DEL 10 SEA 31 SEA 11 DEL 45 MIN SUC 80 INS 1 SUC 1 HEI Which should produce the following output: 45 31 45 0 1 0 2 31 -1 1 31 1 To test your program, I will run my script that it'll have to pass the 2 tests. If all of the above are implemented correctly, the script will work perfectly fine with your project/software. Your program can consist of multiple files, and should be accompanied by a makefile. When compiled with the command ‘make’, an executable called sl should be created. That executable will parse input from its standard input and produce all output in its standard output. No other output except the required output mentioned above should be sent to the standard output.