1. Given memory partitions of 700K, 400K, 200K, and 30 mory partitions of 700K, 400K, 200K, and 300K (in order), how would each of the Best-fit, and wo il algorithms place processes of 200K(1), 400K(J2), 100K(13), and 250K(14) (in order)? Which algor makes the most efficient use of memory? (5 points) Best-fit OOK 100k 200k 300k Worst-fit 700 400K 200k 300k 2. Consider the following string of memory references in terms of the page number requested: 1,3,2, 1.4, 1.5,6, 1, 5, 2, 7,5 Please illustrate the content of the frames used by the process in a pure demand-paged scheme under LRU replacement with 4 frames. Please calculate the page fault rate in each replacement scheme. LRU (5 points) 1 Fault