complete the count teams function in c++ or java

O ALL 2 3. Team Formation HackerRank is organizing a chess tournament for its employees. There are n employees, having IDs 1, 2, n, where the th employee has rating denoted by rating[i]. Two employees can form a team if they have the same rating, and one employee can be in at most one team. There are q queries, each of the form (/, r). For each query, find the number of teams which can be formed considering employees with IDs [1, 1+1,.. r- 1, r]. All queries are independent of each other. Example: Consider n = 4, rating = [2, 3, 4, 2], q=2, queries [[1,4], [3, 4]] For the first query, all employees are considered. Employees with IDs 1 and 4 can be teamed as their ratings are the same. There are no other team formations possible. So, the number of teams is 1. . For the second query, employees 3 and 4 are considered, their ratings are [3, 4]. Since they are different, no teams can be formed. So, the number of teams is 0. Hence, the answer is [1, 0]. Function Description: Complete the function count Teams in the editor below