Computer Time Problem. Assume the school library has a computer room where students can use PCs to do their schoolwork. The computer room has 10 computers, each of which can be used by 2 students at a time if students don't mind sharing the computer with another student. Students can also elect to work alone at a computer if one is available with no students working on it. Create pseudocode similar to the type shown for the Producer-Consumer problem that includes the following:

Computer Time Problem. Assume the school library has a computer room where students can use PCs to do their schoolwork. The computer room has 10 computers, each of which can be used by 2 students at a time if students don't mind sharing the computer with another student. Students can also elect to work alone at a computer if one is available with no students working on it. Create pseudocode similar to the type shown for the Producer-Consumer problem that includes the following:

1. a) A data structure that shows the current number of seats available at each computer (each computer should be initialized to have 2 seats available at the start of the program).
2. b) a SharingStudentprocess that inspects computers, looking for a computer with at least one seat available. If no computer has at least one seat available, the SharingStudent leaves the room. If a computer is found with at least one seat available, the SharingStudent will reserve the seat and then do work; when work is finished, the SharingStudent will vacate the seat and then exit the room. 
3. c) a NonSharingStudentprocess that inspects computers, looking for a computer with 2 seats available. If no computers have 2 seats available, the NonSharingStudent leaves the room. If a computer is found with 2 seats available, the NonSharingStudent will reserve both seats and then do work; when work is finished, the NonSharingStudent will return both seats and then exit the room.
4. d) Some control structure that ensures mutual exclusion when SharingStudents and NonSharingStudent processes are inspecting computers for seats available, attempting to reserve seats, or attempting to release seats. Please note that these processes are not aware of each other and are not cooperating processes.