Problem$1$:$-$

Multiple processes or nodes in a distributed system seek to coordinate access to a shared resource in a mutually exclusive manner. Each process requests access to the critical section by sending REQUEST messages and waits for REPLY messages from all other processes before entering the critical section.

Select the number of process dynamically and Upon exiting the critical section, a process clears its requesting flag and deferred queue, allowing other processes to enter the critical section.

Problem$2$:$-$

A distributed system with three processes $($P$1,$ P$2,$ P$3)$ running on different nodes. The processes share access to a printer, and you need to implement a distributed mutual exclusion algorithm to ensure that only one process can print at a time.

Here are the specific requirements:

$1.$ Each process can request access to the printer by sending a request message.

$2.$ The processes must follow a protocol to obtain permission to print.

$3.$ Once a process is granted permission to print, it should print a message indicating that it is

A$.$ Atie printing, the process releases the printer so that other processes can request access.

Write a code $($any language$)$ to Implement a distributed mutual exclusion algorithm to solve this problem.

Hints:$-$ You need to import $($import java.util.concurrent.Semaphore;$)$A semaphore controls access to a shared resource through the use of a counter. If the counter is greater than zero, then access is allowed. If it is zero, then access is denied

$$ The Printer class manages the token, and processes acquire the variable to update the token holder.

$$ The method in Printer class simulates processes that request access to the printer, print, and release access.

$$ The Semaphore is used to control access to the critical section where the token holder is updated.

Problem istributed fle ystem with multiple servers $(53,52,3)$ and cients C$1,2,3)$ running on$.$

different nodes. The servers store files, and clients need to access and modify these files. Implement a distributed mutual exclusion algorithm to ensure that only one client can modify a file at a time.

Requirements:

$2.$ The eliet ause quest a ers oca i ran permision est message indicating the file's name.

$2.$ Ensue then ie dietiony atied or titis ane filevented trom modifying the

$5.$ Implement a mechanism to handle concurrent access to different files by different