In your neighborhood, people are setting up a downhill soapbox derby race. As a safety measure, bales of hay are set up at the bottom of the hill as a barricade to stop cars and drivers. At what point on the car’s path will it have the most kinetic energy? A) at the very top of the hill B) at the midpoint of the hill C) at the very bottom of the hill D) after it collided with the hay

Consider a file currently consisting of 200 blocks. assume that the file control block (and the index block in the case of indexed allocation) is already in memory. calculate how many disk i/o operations are required for contiguous, linked, and indexed (single-level) allocation strategies, for each of the conditions listed below. in the contiguous-allocation case, assume that there is not room to grow at the beginning but there is room to grow at the end. also assume that the block information to be added is stored in memory.