Single File Programming QuestionProblem StatementNandhu is restructuring the office and wants to remove the last 2 members from the team in the performance matrix list. Write a program to eliminate the last 2 members and display the updated list of office members.Input format :The first line of input is an integer 'n', the number of office members.The second line of input consists of 'n' space-separated integers representing the IDs of office members.Output format :The output displays the list of office members after removing the last 2 members.If the office members list less than 2 members, print "Array size should be at least 2".Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases will fall under the following constraints:1 ≤ n ≤ 101 ≤ office ID ≤ 100Sample test cases :Input 1 :46 7 4 3Output 1 :6 7 Input 2 :110Output 2 :Array size should be at least 2Input 3 :1089 84 27 23 48 19 1 38 27 39 Output 3 :89 84 27 23 48 19 1 38

Single File Programming QuestionProblem Statement:Thiru is working on a grading system for his class of students. He needs a program that takes input for student scores, inserts a new score at the beginning and end of the existing scores, and then displays the modified list of scores.Write a program to help Thiru achieve this.Input format :The first line of input is an integer, the value n, indicating the number of elements in the array.The second line of input consists of n space-separated integers, representing the elements of the array arr[i].The third line of input consists of two integers M and P, representing the value to be inserted at the beginning and ending of the array, separated by a space.Output format :The output is a single line containing n + 2 space-separated integers, which represent the modified array after inserting the element at the beginning and ending of the existing scores.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases will fall under the following constraints:1 ≤ n ≤ 101 ≤ arr[i] ≤ 1001 ≤ M, P ≤ 100Sample test cases :Input 1 :53 4 5 6 72 8Output 1 :2 3 4 5 6 7 8 Input 2 :14590 78Output 2 :90 45 78 Input 3 :1098 37 48 28 16 18 20 100 25 131 19Output 3 :1 98 37 48 28 16 18 20 100 2

Single File Programming QuestionProblem StatementKrish is developing a function to perform a specific array manipulation task. The goal is to remove an element from a given array of integers, 'arr', at a designated position 'p'. The position value 'p' is based on a 1-indexed system, meaning the first element is at position 1, the second at position 2, and so on.If the position is invalid, print "Invalid position!" Otherwise, print the modified array after removal.Input format :The first line of input consists of an integer n, representing the size of the array.The second line of input consists of n space-separated integers, representing the elements of the array.The third line of input consists of an integer p, representing the position to remove an element.Output format :If p is invalid, the output prints "Invalid position!"Otherwise, the output prints the array after removing the element at the specified position, separated by a space.Refer to the sample output for the formatting specifications.Code constraints :In the scenario, the test cases fall under the following constraints:1 ≤ n ≤ 101 ≤ Each element ≤1001 ≤ p ≤ nSample test cases :Input 1 :52 3 5 1 42Output 1 :2 5 1 4 Input 2 :1010 20 40 30 50 70 60 80 90 10012Output 2 :Invalid position!Input 3 :24 5 1Output 3 :5

Single File Programming QuestionProblem StatementIn a busy airport, passengers are holding tickets with unique numbers. Write a program using the linear search algorithm to check if a given ticket number exists in the array of ticket numbers. If the ticket number is found, print a congratulatory message along with the position where it's found. If the ticket number is not found, encourage the passenger with a message for better luck on the next attempt.Input format :The first line of input consists of an integer N, representing the number of tickets.The second line consists of N space-separated integers, representing the ticket numbers.The third line consists of an integer, representing the ticket number to search.Output format :If the ticket number is found, print "Congratulations! Ticket number X found at position Y!", where X is the ticket number and Y is the position (position starts from 1).Otherwise, print "Better luck next time! Ticket number X not found!", where X is the ticket number.Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 1010 ≤ ticket number ≤ 1000Sample test cases :Input 1 :5123 456 789 321 654321Output 1 :Congratulations! Ticket number 321 found at position 4!Input 2 :6741 456 982 364 789 258369Output 2 :Better luck next time! Ticket number 369 not found!

Single File Programming QuestionProblem StatementJenifer is developing a program for a warehouse management system that needs to analyze inventory data. The program receives an array representing the quantities of different products in the warehouse. The task is to count the number of items falling within a specified range of quantities. Help Jenifer to accomplish her task using pointers.Input format :The first line of input consists of an integer N, representing the number of products in the warehouse.The second line consists of N space-separated integers, representing the quantity of products.The third line consists of two space-separated integers, representing the lower limit and upper limit (range).Output format :The output prints the number of products falling within the specified range (both inclusive) of quantities.Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ N ≤ 251 ≤ quantity ≤ 100Sample test cases :Input 1 :1015 25 35 45 55 65 75 85 95 10045 85Output 1 :5Input 2 :523 29 34 48 5935 60Output 2 :2

Single File Programming QuestionProblem statementGinny, an inquisitive mind fascinated by the intricacies of arrays, has posed a challenge for you. She needs a program that can identify and display the unique elements present in an array. Write a program that includes a function named findUniqueElements where the array is passed as an argument.Input format :The first line of input is an integer value 'N', representing the size of the array.The second line of input consists of N space-separated integers arr[i], representing the elements of the array.Output format :The output displays the integers, representing the unique elements identified within the array, separated by spaces.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ N ≤ 151 ≤ arr[i] ≤ 100Sample test cases :Input 1 :73 1 5 2 5 4 3Output 1 :1 2 4 Input 2 :155 2 7 1 4 9 8 6 3 2 5 10 7 12 100Output 2 :1 4 9 8 6 3 10 12 100 Input 3 :23 4Output 3 :3 4