2. Consider the following execution behavior of processes P1, P2, P3, and P4 and resources R1, R2, R3 and R4 with one instance each. P1 Request R1 Request R3 Request R4 Release R4 Release Ri Release R3 P2 Request R5 Request R3 Release R5 Release R3 P3 Request R2 Release R1 Release R1 Release R2 P4 Request R4 Request R2 Release R2 Release R4 Find an execution sequence that results in deadlock if processes P1, P2, P3 and Page 1 28 September P4 run simultaneously and draw R.A.G for that execution sequence. 3. Consider an associative translation look aside buffer (TLB) with access time six (6) milliseconds. 85% of all page-table references are found in the TLB and other 15% is found in the page table. Page table access time is 15 milliseconds. Evaluate the effective memory reference time from the above information