Task 4. The current state of an SSD consisting of 8 blocks is depicted in the following figure. #7 6 #18 7 U 11 U 8 U 4 E 1 #18 2 #2 3 # 17 4 #8 5 # 3 8. #9 U 13 U 7 U 6 I| 1 U 5 U 10 03 E I 11 E 9 8. 6. U 3 U 9 The top left corner of the blocks refer to the number of the block, and the top right corner of the blocks contain the number of programming/erase cycles. Each block consists of 4 pages. For each page the state of the page ("U"=used, "I"=invalid, "E"=erased) and the LBA address of the stored data are provided. In the initial state blocks 1, 3 and 7 are erased, and the write frontier is block 6. (a) How does the state of the SSD change when read requests arrive to LBA address 5, 13 and 2, accordingly. If a new write frontier is needed, select one that ensures the most balanced wearing of the blocks. (b) How does the state of the SSD change when the garbage collector is triggered in the initial state? The garbage collector does not stop till the number of erased blocks increases by one. The garbage collector always selects the block containing the most invalid pages. If there are many of such candidate blocks, it picks the least weared one.