Question 20 Not yet answered As with Part B on the assignments, suppose you are given an input file and a parameter x. Your goal is to read the input one line at a time, and output the maximum of the last x lines. Choose the best (most time- and space-efficient) data structure to solve this problem. Marked out of 1.00 P Flag question Select one: O a. No data storage at all is necessary (other than to store loop iteration variables) O b. A single variable (in addition to loop iteration variables) suffices for data storage O c. A stack (or, deque) is the best choice for data storage O d. A deque (but not a stack or a queue) is the best choice for data storage (this is the deque as we did in class, that implements the List interface) O e. A sorted set is the best choice for data storage