The Durban July is an annual horse race that has been presented every year since 1897. Write a C/C++ program to handle registrations for the race. The program must meet the following specifications:Create a structure (struct) to save the following information for each horse in the race:Name - up to 20 characters;Age - Age in years (integer);Height - The height of the horse in hands (integer); andTime that the horse achieved in the last race in seconds (real value).Create an array of structures (structs) that are used to save the information for four horses. The user types in the information for each horse.After the horse's information is stored in the array, the schedule for the race must be displayed based on the contents of the array. Iterate through the array and display the information on one line for each horse.The horse with the best time for the previous race is named as the favorite. Iterate through the array, identify the horse with the best time and show it at the bottom of the schedule. Assume that each horse's time will be unique.See the figure on the picture attatched below for example output. wateO NotNot secure | efundi.nwu.ac.za/portal/site/0a409130-915f-49c4-88b0-a385a6fd7e8f/tool/5ec8ceFundiHarse #3 - Age: 4Horse #3 - Height: 19Horse #3 - Time for last race: 111.98Enter details for horse #4:Horse #4 - Name: African_Night_SkyHorse #4 Age: 3Horse #4Horse #4Height: 21Time for last race: 113,55黄美******************************************Roster for next race: 鶉篝鶉鶉鶉鶉暑暑********************************************1.2.3.4.Name: Do_It_AgainName: Made_To ConquerName: Secret_Gate,Náme: African_Night_Sky Age: 3 yearsAge: 3 yearsAge: 5 yearsAge: 4 yearsHeight: 18 handsHeight: 20 handsHeight: 19 handsHeight: 21 handsLast run: 123.21 secondsLast run: 156.11 secondsLast run: 111.98 secondsLast run: 113.55 seconds***********************************************************Race favourite: Secret Gate, with a time of: 111.98********************************************************轉普普黄普:Process returned 0 (0x0)Press. any key to continue.execution time : 140.929 sAdditional resources for assignmentNo attachments yetSubmission%3D%3D%3D%3D%3D%3D%3D%3D%3D%3D%3D%3D O Not secure efundi.nwu.ac.za/portal/site/0a409130-915f-49c4-88b0-a385a6fd7e8f/tool/5ec8c381-eFundi=Welcome to the Durban July=-Enter details for horse #1:Horse #1Horse #1Horse #1Horse #1Name: Do It_AgainAge: 3Height: 18Time, for last race: 123.21Enter details for horse #2:Horse #2. - Name: Made_To ConquerHorse #2Horse #2Horse #2 - Time for last race: 156.11Age: 5Height: 20 -Enter details for horse #3:Horse #3Horse #3Horse #3Horse #3Name: Secret_GateAge: 4Height: 19Time for last race: 111.98Enter details for horse #4:m HesHorse #4Horse #4Horse #4Horse #4Name: African_Night_SkyAge: 3Height: 21Time for last race: 113.55************:善善紳軸兽軸紳袖:Roster for next race*********************:菁善善善善善善:善善善普善瀞善******************************Name: Do It_AgainName: Made_To_ConquerAge: 3 yearsAge: 5 yearsHeight: 18 handsHeight: 20 handsLast run: 123:21 secondsLast run: 156.11 seconds2.Type here to search%3D%3D%3D%3D%3D%3D%3D%3D%3D

Define header files <stdio.h> and <conio.h> which contains the standard i/o functions…

Answered: The Durban July is an annual horse race…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

The Durban July is an annual horse race that has been presented every year since 1897. Write a C/C++ program to handle registrations for the race. The program must meet the following specifications:

Create a structure (struct) to save the following information for each horse in the race:
- Name - up to 20 characters;
- Age - Age in years (integer);
- Height - The height of the horse in hands (integer); and
- Time that the horse achieved in the last race in seconds (real value).
Create an array of structures (structs) that are used to save the information for four horses. The user types in the information for each horse.
After the horse's information is stored in the array, the schedule for the race must be displayed based on the contents of the array. Iterate through the array and display the information on one line for each horse.
The horse with the best time for the previous race is named as the favorite. Iterate through the array, identify the horse with the best time and show it at the bottom of the schedule. Assume that each horse's time will be unique.

See the figure on the picture attatched below for example output.