first session the time each member takes to run 400m is noted. At the end of the six weeks these timings are repeated. The club intends to give a prize to the member who has reduced their time over 400m the most. It needs a program that will allow the necessary data to be entered and that will give the reduction in running time for each member and the name of the member with the greatest reduction. The club already has a list of the names of the members as a txt file. The club coach has agreed to help with this program and has gathered the information in the following list: - What data must be supplied? - user input times for first run times for second run - data that already exists names of runners - What is required of the program? Calculate the reduction in running time for each runner Find the runner with the greatest reduction The coach has decided to store the names of the runners and the two running times for each runner in three parallel lists. She writes down a first version of an algorithm: Input the running times for each runner Calculate the reduction in running time for each runner Find the runner with the greatest reduction Output the name of the runner She then refines the algorithm: Repeat (number of runners) times input the first running time input the second running time For each runner calculate the reduction as first running time - second running time Find the runner with the greatest reduction Output the name of the runner Questions: a. Select the sub-process that still needs to be refined. be chosen to be implemented as a component because r characteristic of the task that makes it suitable to be b. 'Input the running times for each runner' might be chosen to be implemented as a component because it is a reasonably substantial task. Select another characteristic of the task that makes it suitable to be implemented as a component