Instead of reading in an entire list N1, N2, . . . all at once, some algorithms (depending on the task to be done) read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e. g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values V ≥ 0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list.