A Cursor Implementation of a linked list is as follows: typedef struct { Elem Type data; int next; } CNode; CNode SPACE[MAXSIZE]; The next fields of SPACE are shown below: 0 1 2 3 4 5 6 7 8 9 10 11 next 7 6 9 1 3 2 8 5 0 11 0 10 Please answer following questions: a. Write the index sequence of cells in the Free List(e.g., 0, 4, 5, ...."). b. There is a list in SPACE. What is the index sequence of nodes in this list? c. After deleting second node in the list of part (b), what is the index sequence of cells in the Free List? A Cursor Implementation of a linked list is as follows: typedef struct { Elem Type data; int next; } CNode; CNode SPACE[MAXSIZE]; The next fields of SPACE are shown below: 0 1 2 3 4 5 6 7 8 9 10 11 next 7 6 9 1 3 2 8 5 0 11 0 10 Please answer following questions: a. Write the index sequence of cells in the Free List(e.g., 0, 4, 5, ...."). b. There is a list in SPACE. What is the index sequence of nodes in this list? c. After deleting second node in the list of part (b), what is the index sequence of cells in the Free List