Memory contains 6 holes with their sizes shown in the table. A sequence of requests for 3 blocks have arrived with sizes 60,90 , and 40 . Select the hole allocated to each request by the best-fit allocation strategy Block with size 60 : Block with size 90 Block with size 40 : Enter the number of holes that best-fit had to examine to allocate the 3 blocks if the holes are as given in the table (not sorted by size). Enter the number of holes that best-fit would have to examine to allocate the 3 blocks if the holes were always: maintained in sorted order (ascending by hole size)