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

Program to implement linear search.

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 >

Saran wants to develop a program that uses linear search to find the majority element in an array, which is an element appearing more than n-2 times, where n is the size of the array. The program should input the size of the array and its elements. Display the majority element if found, and indicate if no majority element is present in the array.Help Saran in developing the program.Input format :The first line of input consists of an integer n, representing the number of elements in the array.The second line consists of n space-separated integers, representing the array elements.Output format :The output prints an integer representing the majority element.If no such element is found, print "No majority element found."Refer to the sample output for formatting specifications.Code constraints :1 ≤ n ≤ 101 ≤ array elements ≤ 100Sample test cases :Input 1 :51 4 1 1 1Output 1 :1Input 2 :

Problem StatementJohn, Ram, and Joseph are comparing their finances after receiving their monthly salaries and incurring some expenditures.Your task is to create a program that, with the input of their salaries and expenditures, utilizes assignment operators (+= and -=) to compute and identify which friend has the highest remaining amount.Input format :The first line of input consists of two space-separated integers, representing John's salary and expenditure.The second line of input consists of two space-separated integers, representing Ram's salary and expenditure.The third line of input consists of two space-separated integers, representing Joseph's salary and expenditure.Output format :The output displays the name of the friend who has the highest remaining amount in the format "{Name} has more money".Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:100 ≤ salary ≤ 1050 ≤ expenditure ≤ 105Sample test cases :Input 1 :2000 501500 307500 10Output 1 :Joseph has more moneyInput 2 :50000 1000057000 20000100000 100000Output 2 :John has more moneyInput 3 :2500 103500 251000 10Output 3 :Ram has more money

Single File Programming QuestionProblem StatementAlex wants to create a program to search a target value in a sorted array. The program should input the array size and elements, as well as the target value. Utilizing binary search, it should determine if the target is present, and if so, provide the index. If not, display a message indicating its absence.Assist Alex in completing the program efficiently.Input format :The first line of input consists of an integer N, representing the size of the sorted array.The second line consists of N space-separated integers, the elements of the sorted array in ascending order.The third line consists of an integer target, the value to search for in the array.Output format :If the target is present in the array, print "The target value X is present at index Y", where X is the target element and Y is the index position (index starts from 0).If the target is not present, print "The target value X is not present in the array", where X is the target element.Refer to the sample output for formatting specifications.Code constraints :The given test cases will fall under the following constraints:2 ≤ N ≤ 101 ≤ elements ≤ 1000Sample test cases :Input 1 :514 29 37 48 5948Output 1 :The target value 48 is present at index 3Input 2 :10125 137 248 358 489 587 652 741 823 912850Output 2 :The target value 850 is not present in the array