FAST

Part 5. [10 marks] Given a file where each line is a single (32-bit) non-negative integer, read in the lines of the file one at a time; create a new list out of the original by reading in groups of i lines for i=1,2,3,4, and reversing the order of each group of lines (but the groups themselves stay in the original order.) From this new list, consider the last group of values: use these as circular indices to access and sum modulo 240223 the elements of the new list. Output this sum. If the file is empty, output 0 . For example, if the input is 10 20 30 40 50 60 2 3 15 then the modified list is 1030206050401532 Thus n=9 and the last group is 15,3,2 so we will sum the elements at indices (15%9=6, 3%9=3, and 2%9=2 for a final sum of (15+60+20)%240223=95. For more examples, see the tests in the tests/ directory that have the form lab2-p5-x-in.txt for the input, and the matching lab2-p5-X-out.txt for the expected output