Question One (20 marks) (a) Explain 3 stages of Address binding? (3 marks) (b) Given memory partitions of 250K, 400K, 300K and 200K are in order. (i) How would each of the First-fit, Best-fit and Worst fit algorithms place processes of 350K, 250K, 120K and 250K (in order)? (i) Which algorithm makes the most efficient use of memory? Explain briefly. List 2 problems of contiguous memory allocation? Available memory scattered across multiple free holes as in the Figure 1 (4 marks) (1 mark) (4 marks) (c) (d) 100 120 150 Hole 1 Hole 2 200 Hole 3 300 Figure 1 (i) Can we allocate process with a request 120K? Explain briefly. (2 marks) (ii) Explain how compaction can be used to allocate the request. (2 marks)