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 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 StatementReni is working on a programming challenge where she needs to add an element 'x' into an existing array at a specified index 'k'. The task requires her to take an existing array and two integers, 'x' and 'k'. Her goal is to insert the element 'x' into the array at the index 'k', effectively shifting the subsequent elements to the right. Once the insertion is complete, Reni should display the updated array.Help her with the program.Input format :The first line of input is an integer 'n', representing the initial size of the array.The second line of input consists of 'n' space-separated integers, the elements of the array.The third line of input is an integer 'x,' the element to be inserted.The fourth line of input is an integer 'k', representing the position to insert 'x.'Output format :The output displays the array after inserting 'x' at position 'k', separated by a space.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ n ≤ 10Size of the array = n+11 ≤ Each element ≤ 10000 ≤ k ≤ n1 ≤ x ≤ 1000Sample test cases :Input 1 :510 20 30 40 50151Output 1 :10 15 20 30 40 50 Input 2 :102 5 3 9 8 12 20 97 37 10002310Output 2 :2 5 3 9 8 12 20 97 37 1000 23 Input 3 :3178 567 10008972Output 3 :178 567 897 1000

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