Question

There are eight cars in every team called Chevy and Ford. One car from each team races its opponent on drag strip. Read in racing times for the eight Chevy cars and then read in times for the eight Ford cars. Accumulate the times into arrays known as Chevy[ ] and Ford[ ]. Then catalogue the winner of each pair, giving number of seconds the winner won by. At the ending declare that team won based on which team had most wins. Below is an example.

Enter the times for the Chevy cars: 5.4 7.2 4.0 9.1 5.8 3.9 6.2 8.1
Enter the times for the corresponding Ford cars: 5.8 6.9 3.9 9.2 5.8 3.8 6.0 8.5
And the winners are:
Chevy by 0.4 sec
Ford by 0.3 sec
Ford by 0.1 sec
Chevy by 0.1 sec
Tie !
Ford by 0.1 sec
Ford by 0.2 sec
Chevy by 0.4 sec
and the winning team is: F O R D!

1. Allow the racing times for each of the Chevy cars into the array Chevy[ ].
2. Allow the racing times for each of the Ford cars into the array Ford[ ].
3. Then declare the wining car for each race, giving the winning time in seconds.
4. If the times are identical, then declare the race was a tie.
5. Finally, declare that team won the match, assuming a tie is possible.

Make sure to think about logic and design first (IPO chart, pseudo code, and flowchart), then code Visual Basic program.