Please send the answers with workings. I'd be grateful if you send me detailed answers. Include the possible explanations also.

Thank you.

Time left 021:21 Given memory partitions of 300K, 400K, 200K, 100K and Sook are in order, a) List available holes with the size after running First-fit algorithm with process requests of 230K, 180K, 260K, 220K, 60K and 350K in order. (2 marks) b) List available holes with the size after running Best-fit algorithm with process requests of 230K, 180K, 260K, 220K, 60K and 350K in order. (2 marks) List available holes with the size running Worst-fit algorithm with process requests of 230K, 180K, 260K, 220K, 60K and 350K in order. (2 marks) d) Re-run Worst-fit algorithm given in part (c) after compaction and list the available holes. (2 marks) e) If a memory reference takes 40 nanoseconds, explain total time a memory reference take. (2 marks) B 1 a) hole 1 - 10 hole 2-0 hole 3-200 hole 4-100 hole 5 - 240