After each step, give the value of the updated semaphore and the content of the updated semaphore queue. Counting Semaphores: S$1,$ S$2$ S$3$ Binary Semaphores: S$4,$ S$5,$ S$6$ S$1=1,$ S$2=0,$ S$3-2,$ S$4=0,$ S$5=1,$ AND S$6=1$ Semaphores initial values: $1)$ P$1$: P$($S$3),$ P$2$: P$($S$5)3)$ P$3$: P$($S$5)4)$ P$5$: P$($S$2)5)$ P$2$: V$($S$2)6)$ P$10$: V$($S$6)7)$ P$2$: P$($S$4)8)$ P$6$: P$($S$5)9)$ P$4$: V$($S$4)10)$P$4$: P$($S$2)$ Can you go through each steps, and the rules. I dont understand the difference between counting and binary semaphores. What does P and V mean? What makes the queue empty or bocked? Please and thank you!