$($Question from Stallings$)$ A dynamic partitioning scheme is being used, and the following is the memory configuration at a given point in time:

The sizes of the partitions are $20M,20M,40M,60M,20M,10M,60M,40M.20M,30M,40M,$ and $40$ M as illustrated in the above image. The black areasare allocated blocks; the white areas are free blocks. Thus, according to the image, the following are the starting addresses for each of the partitions:

Location $0,20M$ allocated

Location $20M,20M$ free

Location $40$ M $40$ M allocated

Location $80M,60M$ free

Location $140M,20M$ allocated

Location $160M,10M$ free

Location $170M,60M$ allocated

Location $230M,40M$ free

Location $270M,20M$ allocated

Location $290M,30M$ free

Location $320M,40M$ allocated

Location $360M,40M$ free

The next three memory requests are for $40M,20M,10M.$

Indicate the starting address for each of the three blocks using the following placement algorithms: first$-$fit, best$-$fit, worst$-$fit.

$7.$ Consider the following segment table:

$\backslash$table$[[$Segment$,$Base,Length$],[0,219,600],[1,2300,14],[2,90,100],[3,1327,580],[4,1952,96]]$

What are the physical addresses for the following logical addresses?

a$.0,430$

b$.1,10$

c$.2,500$

d$.3,400$

e$.4,112$