Guidance for sleeping barber monitor solution
<p>I am trying to write a monitor solution for the sleeping barber problem using two barbers and customers of three types who are either waiting solely for barber 1, barber 2 or may not care which barber cuts their hair. </p>

<p>I was hoping for guidance on this problem - </p>

<p>My thoughts so far are that the algorithm will utilize a single list for the waiting customers and can use procedures such as </p>

<p>try_to_get_haircut()</p>

<p>if_not_first()</p>

<p>wake_up_barber()</p>

<p>wait_for_haircut()</p>