Given the following sequence of requests for memory space in order: Process A 200, Process B 220, Process C 80, Process D 150, Process E 160, Process F 140, Process G 80. Given: The list of 'holes' in the order (as shown) in a variable partition memory system. Fill in the chart to show which holes would be allocated to the processes (A - G) by the different algorithms listed. All numbers are in kilobytes. All algorithms start the search from the beginning of memory except for the Next Fit which starts from the node that it is at. If there is a 'new' hole created it is inserted in the list prior to any new search