C language only (no C++)

Thanks!

CS210 - Machine Problem 4 Swiss Tournament Manager 20 Points Assigned: September 26, 2017 Due: October 5, 2017 Tournaments are design to find out who is the best at a particular competition out of a group of partic- ipants. There are many different formats of tournaments with different properties. An interesting fornmat is known as a Swiss Tournament. In this type of tournament, there are no eliminations, so everyone gets to play every round. In each round, participants with the same win-loss (or as close as posible). This ensure record are paired against esch other attempts to ensure that most games are competitive and that the best players can be quickly determined. This program will run a Swiss Tournament with a given number of participants for a given number of rounds. It will identify the players by consecutive id numbers starting with 1001. After each round it wil display the current standings. The pairings for the next round will be determined by the ranks in that display (i.e. The first two players will play against each other in the next rounds, then 3 and 4, then 5 and 6, etc.) See the sample run for examples Program Design Again, this program has several tasks to be performed. In am going to describe the functions that you will most likely need to write. However, it is going to be up to you to design the parameter lists, local variables and algorithms for each function. Data The data for the tournament consist of the following: The number of participants The number of rounds An array of id numbens . An array of wins for each id: (Note: These arrays are known as paralel arrays, which means that the id in slot i, corresponds to the number of wins in slot i in the other array) Print Greeting Prints the greeting for the application Get Number of Participants This function is responsible for prompting the user for the number of participants in the tournament, vali- dating it, and getting the data back to the calling function