Assume you have a heap file implemented in a linked list structure with the header page connected to a linked list of full pages and a linked list of pages with free space. There are 5 full pages and 10 pages with free space. In the worst case, how many pages would you have to read to see if there is a page with enough space to store some record with a given size

When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. this can be done by normalizing to values between 0 and 1, or throwing away outliers. for this program, adjust the values by subtracting the smallest value from all the values. the input begins with an integer indicating the number of integers that follow. ex: if the input is 5 30 50 10 70 65, the output is: 20 40 0 60 55