Consider eight threads (T1-T8) that are synchronized using Semaphores. Each thread has a critical section that is constrained to execute according to the following precedence relation: T2, T3 and T4 cannot execute until T1 has finished. T5 cannot execute until T2 AND T3 has finished. T6 cannot execute until T3 AND T4 has finished. - T7 cannot execute until T5 has finished. T8 cannot execute until T6 has finished. a) Draw the precedence graph for the thread execution. b) Give the sequence of Semaphore operations in each thread to satisfy the precedence graph. Indicate the initial values of Semaphores. For full credit, your solution should maximize concurrency; i.e. do not impose any constraint that is not defined.