Given 5 memory partitions and 4 Processes. Memory partitions: 200KB,600KB,100KB,300KB, 500KB (in order) Processes: P1=243KB,p2=143KB,p3=92KB,p4= 326KB (in order) 1. How would the first-fit algorithm place the processes? 2. How would the best-fit algorithm place the processes? 3. How would the worst-fit algorithm place the processes? 4. Which algorithm makes the most efficient use of memory