Implement Peterson$$s Solution for two processes in C$.$ Each process will repeatedly access a critical section, which updates a shared variable. The program should ensure that the critical section is accessed by only one process at a time.

Assignment Details:

Shared Variables:

int turn: A shared variable that indicates whose turn it is to enter the critical section.

int flag$[2]$: An array of two elements where each element indicates whether a process is ready to enter the critical section.

Processes:

You will simulate two processes $($P$0$ and P$1)$ using two separate threads. The threads will run concurrently, each trying to access the critical section multiple times.

Critical Section:

Both processes will modify a shared variable $($e$.$g$.,$ incrementing a counter or printing a message$)$ in the critical section.

Peterson$$s Solution Algorithm: Implement the following logic for each process:

$//$ Entry section for process P$0($similar for P$1$ with appropriate changes$)$

flag$[0]=1$; $//$ P$0$ is ready to enter critical section

turn $=1$; $//$ Set turn to P$1\text{'}$s turn

while $($flag$[1]$ && turn $==1)$; $//$ Wait if P$1$ is ready and it's P$1\text{'}$s turn

$//$ Critical section

$//$ Modify shared variable $($e$.$g$.,$ increment counter or print$)$

$//$ Exit section

flag$[0]=0$; $//$ P$0$ is leaving critical section

Non$-$Critical Section: Each process should simulate performing some non$-$critical work $($e$.$g$.,$ a random delay or printing a non$-$shared variable$).$

Termination: After each process has entered the critical section a predefined number of times $($e$.$g$.,5$ times each$),$ the threads should terminate.