A Company has decided to give some gifts to all of its employees. For that, the company has given some rank to each employee. Based on that rank, the company has made certain rules to distribute the gifts.The rules for distributing the gifts are:Each employee must receive at least one gift.Employees having higher ranking get a greater number of gifts than their neighbours.What is the minimum number of gifts required by the company?Constraints:Constraints1 < T < 101 < N < 1000001 < Rank < 10^9InputFirst line contains integer T, denoting the number of test cases.For each test case:First line contains integer N, denoting the number of employees.Second line contains N space separated integers, denoting the rank of each employee.OutputFor each test case print the number of minimum gifts required on a new line.Example:ExampleInput251 2 1 5 221 2Output73Explanation:ExplanationEmployee # 1 whose rank is 1 gets one giftEmployee # 2 whose rank is 2 gets two giftsEmployee # 3 whose rank is 1 gets one giftEmployee # 4 whose rank is 5 gets two giftsEmployee # 5 whose rank is 2 gets one giftTherefore, total gifts required is 1 + 2 + 1 + 2 + 1 = 7Similarly, for testcase 2, adhering to rules mentioned above,Employee # 1 whose rank is 1 gets one giftEmployee # 2 whose rank is 2 gets two giftsTherefore, total gifts required is 1 + 2 = 3Public Test Cases:# INPUT EXPECTED OUTPUT1 151 2 1 5 272 121 23

In a school, there is a row of  N students, each with their own academic rating. The teachers want to reward the students with candies, but they have specific rules:Minimum Candy Rule: Every student must receive at least one candy.Higher Rating, More Candies: Students with a higher academic rating should receive more candies than their neighbors.What is the minimum number of candies you must give?Input FormatThe first and only argument is an integer array A representing the rating of children.Output FormatReturn an integer representing the minimum candies to be given.Example InputsInput 1: A = [1, 2]Input 2: A = [1, 5, 2, 1]Example OutputsOutput 1: 3Output 2: 7Problem Constraints1 <= N <= 105-109 <= A[i] <= 109

On a particular day, a salesman sold three types of toys. Each toy of the 3 varieties costs Rs.100, Rs.50, and Rs.25 respectively. If the total sale on that day was Rs.300 and the salesman sold at least one toy of each variety, find the maximum number of toys he could have sold.Choices:- 8 10 9 7

Answer the questions below.(If necessary, consult a list of formulas.)(a) From a collection of 51 store customers, 3 are to be chosen to receive a special gift. How many groups of 3 customers are possible?(b) A certain committee consists of 17 people. From the committee, a president, a vice-president, a secretary, and a treasurer are to be chosen. In how many ways can these 4 offices be filled? Assume that a committee member can hold at most one of these offices.

Greta is visiting the hospital in order to give stuffed animals and books to sick children. She has 60 stuffed animals and 84 books to give. If she wants to give the same combination of stuffed animals and books to each child, with no gifts left over, what is the greatest number of children Greta can give gifts to?

Calculate minimum number of such operations needed to ensure that every colleague has the same number of chocolates.