Problem StatementThe university has a list of student GPAs, and they want to identify students who are eligible for a scholarship. To be eligible, a student's GPA must be greater than 3.5. Your task is to write a program using linear search to find the number of eligible students for scholarships.Input format :The first line of input consists of an integer N, representing the number of students.The second line consists of N space-separated floating-point numbers, each representing the GPA of a student.Output format :The output prints the number of eligible students (those with a GPA greater than 3.5).If no such students are found, print "No students found with GPA > 3.5"Refer to the sample output for formatting specifications.Code constraints :The given test cases will fall under the following constraints:1 ≤ N ≤ 100.0 ≤ GPA ≤ 10.0Sample test cases :Input 1 :73.2 4.1 2.9 3.8 3.5 3.7 3.6Output 1 :4Input 2 :43.5 3.7 2.5 4.6Output 2 :2Input 3 :51.2 2.3 2.6 3.4 3.5Output 3 :No students found with GPA >

Single File Programming QuestionPlacement EligibilityA company, ABC Corp, has set specific eligibility criteria for its internship program. Applicants must have a minimum Grade Point Average (GPA) of 6.0 and must score at least 50.5 in the initial screening test. Write a program to determine if a student qualifies for the internship based on these criteria.Note: Use the Nested ternary operator.Input format :The first line of input consists of an integer m, representing the CGPA value.The second line of input consists of floating point number s, representing the initial screening test score.Output format :The output prints either "Eligible for Next Round", "Not Eligible" or "Try again..." based on the conditions.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:4 ≤ m ≤ 1020.0 ≤ s ≤ 100.0Sample test cases :Input 1 :786.1Output 1 :Eligible for Next RoundInput 2 :460.1Output 2 :Not EligibleInput 3 :734.1Output 3 :Try again...Input 4 :10100.0Output 4 :Eligible for Next RoundNote :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

Problem StatementAlex, a logistics manager, is responsible for handling various pieces of luggage. He needs to determine the weight distribution among these pieces and find the heaviest and lightest pieces, along with the weight difference between them. To accomplish this, he plans to create a simple program that takes as input the weights of various pieces of luggage and uses the linear search algorithm to search and identify the heaviest and lightest pieces, as well as calculate the weight difference between them.Write a program to help Alex accomplish this task.Input format :The first line of input consists of an integer N, representing the number of luggage.The second line consists of N space-separated integers, representing the weights of the luggage.Output format :The first line of output prints "Heaviest piece weight: ", followed by the weight of the heaviest piece.The second line prints "Lightest piece weight: ", followed by the weight of the lightest piece.The third line prints "Weight difference: ", followed by their weight difference.Refer to the sample output for formatting specifications.Code constraints :The test cases fall under the following constraints:1 ≤ N ≤ 101 ≤ weight of each piece ≤ 100Sample test cases :Input 1 :510 15 20 25 30Output 1 :Heaviest piece weight: 30Lightest piece weight: 10Weight difference: 20Input 2 :870 65 80 75 60 55 50 45Output 2 :Heaviest piece weight: 80Lightest piece weight: 45Weight difference: 35

The first line contains an integer, , the number of students.The subsequent lines describe each student over lines.- The first line contains a student's name.- The second line contains their grade.ConstraintsThere will always be one or more students having the second lowest grade.Output FormatPrint the name(s) of any student(s) having the second lowest grade in. If there are multiple students, order their names alphabetically and print each one on a new line.

Program to implement linear search.

Single File Programming QuestionProblem StatementJamie is managing a school and is looking to find out the number of students in the class based on the sum of their scores and the average score.He wants to design a program that takes the average score and sum of scores as input and outputs the calculated number of students in the class using pointers.Input format :The first line of input consists of an integer value n, representing the sum of scores.The second line of input consists of a floating-point value f, representing the average score.Output format :The output displays the calculated number of students in the class.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ n ≤ 1051.0 ≤ f ≤ 100.0Sample test cases :Input 1 :187575.45Output 1 :24Input 2 :20010.25Output 2 :19Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.Marks : 10Negative Marks : 0WhitelistSet 1:*