In which of the following scenarios is it necessary (i.e. very very helpful) to use two separate data structures to store our data elements in order solve the problem, provided we don't want to loop over the data more than twice? (Note this is different than wanting a copy of our data. Here l'm suggesting that our data is spread out over multiple data structures, not duplicated.) a) For each line of the file, output the line if it is a multiple of x, where x is given as input. b) For each line of the file, output the line if it is a multiple of v, where v is the value of the last line of the file. c) For each line of the file, output the line if it is a multiple of the previous line lif it exists). d) For each line of the file, output every vth line, where v is the value of the last line of the file. e) Output the lines of the file that are multiples of the previous line, but in reverse order from the input file. f) Output all lines of the file in reverse order from the input file. g) For a given input x, print out the first Y multiples of x, where Y is the number of multiples of x2. h) Create a modified list from the input file, where value i is inserted after iv elements of the original input file, where v is the value of the last line of the file. i) For each in 0,1,,v1, output all lines that are i modv, where v is the value of the last line of the file. j) For each i=0,1,,v1, output all lines that are i mod v in reverse order, where v is the value of the last line