P-Multilist

Design a program of multilist to host student-class data. The multilist contains up to 3000 classes and 10000 students. Each node in the multilist should store { student number, class number, grade} in the ranges of {1~10000, 1~3000, 0~100 } respectively. The first-row is a student list indexing student numbers. The first-column nodes is a class list indexing class numbers. Such nodes can be initiated after a student-class pair is input. Grade can be asked after the node is inserted, or remain as empty (until late input). Input data and insert nodes with searching function 1 Input from console by typing (student number, class number), e.g., (4, 130), which means student 4 takes course 130. the program will insert a node to the multilist and connect it horizontally and vertically in the order of class number and student number with the nodes already there by pointers. Print for output student list or class list as follows. 2. Print class lists for all non-empty classes, e.g., class 1: students 3, 4, 6, ....; class 34: students 5, 98, 123, ....; .................... 3 Print such student lists for all active students who take courses, e.g., student 1: classes 355, 389, 991; student 2: classes 5, 6, 98; student 89: classes 65, 456; ................... Hint: Although the multilist structure should host input of students (up to 10000) and classes up to 3000, the data node will not be created until a real input is given. No empty 2D array should be created in advance. That will save a lot of memory if only a few nodes, i.e., students and classes, are input eventually. To achieve these print functions, searching/finding nodes in current multilist is necessary in the program. Searching has two phases going through a student (or class) index list and then class (or student) list. respectively. If a node can not be found either in the index list or student-class pair list, insertion of a new node is needed. If at the very beginning, the student index node or class index node is not existing, you need to create such a node first accordingly. If a student-class pair has been created on one chain, it needs to be wired in the other chain in correct order as well. The index nodes here are the first row nodes for students, and first column nodes for classes. Use 0 for dummy fields in both class index nodes and student index nodes, rather than creating separate arrays or different data structure. This will keep your program the minimum. CODE should be submitted in a zipped file with a note describing running environment, language, and compiling instruction.