In a startup software company, there are two kinds of employees, C Developers and Java Developers. Each employee has a unique ID as integer, a monthly salary as integer, and performance as integer, which can have an integer value between 1 to 5 (inclusive).

Furthermore, the startup company has three C Developers and three Java Developers as employees.

With this information given,

  1. Define a struct with three fields, and name:
    1. Name: Employee
    2. Fields: three integers ID, salary, and performance.
  2. Define another struct with two fields, and name:
    1. Name: Company
    2. Fields: two Employee arrays, one named cDevelopers, and the other one named javaDevelopers, both containing three elements.
  3. Write a function named maxPerformance which takes an array of Employees as input parameter and finds the employee with the highest performance among the given employees and returns the ID of the employee as integer. (Assume that the employee who has the highest performance for each employee type is unique).

Main program is given for you. In main program, information about employees are read from the user, maxPerformance is called twice (once for C Developers and once for Java Developers), salary of the employees with the best performance is increased by 500, and the ID and updated salary of the best performing employees are printed on the screen. Don't change anything in main program.

Examples:
INPUT OUTPUT
0 3000 4
1 3500 3
2 4000 2
0 2250 5
1 2500 3
2 2000 1
0 3500
0 2750
0 2000 3
1 3000 4
2 3000 1
0 2100 1
1 2400 3
2 2150 5
1 3500
2 2650
0 1400 1
1 2500 2
2 1500 3
0 3000 5
1 1500 3
2 2050 1
2 2000
0 3500


Important issues about all exams/projects/quizzes: