# CIS 115 Week 6 iLab—Winner of the Chevy and Ford Racing Teams

Name:_________________Week 6 iLab—Winner of the Chevy and Ford Racing TeamsTCO 5—Given a simple problem that requires iteraTon, create a soluTon algorithm that employsloops.TCO 6—Given a simple problem that requires simple data structures, design, code, and test a soluTonalgorithm that uses arrays.TCO 8—Given a more complex problem, develop a complete soluTon that includes a comprehensivestatement of the problem, complete program design, and program documentaTon.ScenarioThere are eight cars in each team called Chevy and Ford. One car from each team races its op-ponent on the drag strip. Read in the racing times for the eight Chevy cars and then read in thetimes for the eight Ford cars. Store the times into arrays called Chevy[ ] and Ford[ ]. Then list thewinner of each pair, giving the number of seconds the winner won by. At the end declare whichteam won based on which team had the most wins. Below is a sample match.Enter the times for the Chevy cars: 5.47.24.09.15.83.96.28.1Enter the times for the corresponding Ford cars: 5.86.93.99.25.83.86.08.5And the winners are:Chevy by 0.4 secFord by 0.3 secFord by 0.1 secChevy by 0.1 secTie !Ford by 0.1 secFord by 0.2 secChevy by 0.4 secAnd the winning team is: F O R D !Accept the racing times for each of the Chevy cars into the array Chevy[ ].Accept the racing times for each of the Ford cars into the array Ford[ ].Then declare the wining car for each race, giving the winning time in seconds.If the times are identical, then declare the race was a tie.Finally, declare which team won the match, assuming a tie is possible.Be sure to think about the logic and design first (IPO chart, pseudocode, and flowchart), thencode the C# program.