Pascal's Triangle is a triangular array in which every number represents thesum of the two numbers directly above it. The pattern starts with two rows ofones. Here is Pascal's Triangle up to the 5th row:11 11 2 11 3 3 11 4 6 4 11 5 10 10 5 1Design and implement a recursive program to determine and print the nth lineof Pascal's Triangle. Your program should take an integer n as input andreturn the nth line of Pascal's triangle (consider the topmost line the "0th"line).(Hint: use an array to store the values on each line)

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.