Q1. Consider a system consisting of Five resources (each has single instance) of the same type that are shared by Eight processes, each of which needs at most two resources. Show that the system is deadlock or deadlock-free. You must draw the system and is explain the result. Q2) Given five memory partitions of 220 KB, 380 KB, 410 KB, 132 KB, and 640 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 425 KB, 180 KB, 850 KB, and 350 KB 250 KB (in order)? Which algorithm makes the most efficient use of memory? (3) What does a claim edge signify in a resource allocation graph? You must show is examples