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!

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 X, 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.

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

Single File Programming QuestionProblem StatementAkil is attending a special event and has a unique ticket that allows him to move to the front of the line. To make use of this privilege, Akil decides to insert himself at the beginning of the line.Write a program that helps Akil achieve this using the array insertion concept.Input format :The first line of input is an integer N representing the current size of the line.The second line of input consists of N space-separated integers Positions[i], representing the current positions of the people in the line.The third line of input is an integer M representing Akil's unique ticket number.Output format :The output displays a single line containing N+1 space-separated integers representing the updated positions in the line after Akil inserts himself at the front.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases will fall under the following constraints:2 ≤ N ≤ 101 ≤ Positions[i] ≤ 1001 ≤ M ≤ 100Max_Size = 100Sample test cases :Input 1 :21 5 6Output 1 :6 1 5 Input 2 :545 67 34 21 1289Output 2 :89 45 67 34 21 12 Input 3 :101 4 5 6 7 98 76 56 89 10090Output 3 :90 1 4 5 6 7 98 76 56 89 100

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 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