Consider a swapping system in which memory consists of the following hole sizes in memory order: 10KB (size of the 1st hole), 4KB (size of the 2 nd hole, and so on), 20KB, 18KB, 7KB, 9KB, 12KB, and 15KB. Which hole is taken for successive segment requests of

(a) 12KB

(b) 10KB

(c) 9KB

For first fit algorithm?

Now, repeat the question for best fit, worst fit and next fit.