A program consists of $3$ concurrent processes P$0,$ P$1$ and P$2$ along with $3$ binary semaphores. The

semaphores S$0,$ S$1$ and S$2$ are initialised as $1,0$ and $0,$ respectively.

P$0$ P$1$ P$2$

While $($true$)\{$

Wait $($S$0)$;

Print $(0)$;

Release $($S$1)$;

Release $($S$2)$;

$\}$

Wait $($S$1)$;

Release $($S$0)$;

Wait $($S$2)$;

Release $($S$0)$;

What is the minimum number of times P$0$ will print $0?$