Two processes maintain a linked-list to keep the record of students. Each node of a linked-list contains personal and academic information of a student. Both processes can insert and delete nodes in the list. The list can be displayed, searched for any data in both processes.

Write two C programs to implement shared linked-list. The linked-list and semaphore variable will be created on shared memory instead of the heap. You may put a limit on the number of nodes the list can have to make the solution simple.