Question 10 5 pts A system has processes P1, P2, P3, P4 and resource types R1 (one instancel, R2 (two instances), R3 (one instance). Consider the following resource allocation graph, defined by these directed edges: P1 ne instance of R2 R1P1 P2R1 one instance of R2P3 one instance of R2-P2 P3 R R3>P4 P4R1 Is the system deadlocked? there is at least one cycle but we cant say if it is deadlocked ? could not see any cycles, so the answer is no. Question 11 How is paging similar to a dynamic relocation scheme using a relocation register? the page number is equivalent to the relocation reper O the page table address is siilar to the relecation register the r ame number from the page lable is simar to the relocation eeister. The omset rrom the logical address is added to the frame start address to get the physical address. they have completely different schemes for address translation