Teju considers the number 3 unlucky and wishes to remove the element located at the 3rd position in an array, considering the first position in the array as position 1. Write a program that eliminates the element at this 3rd position and then displays the modified array.Input format :The first line of input is an integer 'n', the size of the array.The second line of input consists of 'n' space-separated integers representing the elements of the array.Output format :The output displays space-separated integer array values after removing the element at the 3rd position.Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases will fall under the following constraints:3 ≤ n ≤ 101 ≤ Each array element ≤ 1000Sample test cases :

Suppose the array a contains 3 4 6 9 12 13 and currentSize is 5. Walk through the following code that removes the element at position 1.123456int pos = 1;for (int i = pos + 1; i < currentSize; i++){ a[i - 1] = a[i];}currentSize--;Track variables in a trace table. On a sheet of paper, make the table below (the first row is filled in with initial values):currentSize i a[0] a[1] a[2] a[3] a[4] a[5]5 3 4 6 9 12 13Add a row to the table after every iteration of the for loop.1)Lines 1 and 2 execute. What is the value of i?CheckShow answerCorrect22)Line 4 executes. What is the value of a[1]?CheckShow answer3)The execution flow returns to line 2. What is the value of i?CheckShow answer4)Line 4 executes. What is the value of a[2]?CheckShow answer5)The execution flow returns to line 2. What is the value of i?CheckShow answer6)Line 4 executes. What is the value of a[3]?CheckShow answer7)The execution flow returns to line 2. What is the value of i?CheckShow answer8)The for loop completes, and line 6 executes. What is the value of currentSize?

How to delete the last three elements from an integer array?Note: In the options, n is the size of the array, and "arr" is the name of the 1D ar

Problem StatementRajini is a student who loves coding. He is working on an array operations problem. In the given problem, Rajini needs to remove the first element from the array and print the modified array.Help Rajini write a program that takes an array of integers as input, deletes the first element from the array, and prints the modified array.Input format :The first line of input is an integer n, representing 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].Output format :The output displays n space-separated integers of the modified array after deleting the first element.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 ≤ arr[i] ≤ 100Sample test cases :Input 1 :56 7 4 3 1Output 1 :7 4 3 1 Input 2 :210 47Output 2 :47 Input 3 :1037 84 27 23 48 19 1 38 27 39 100Output 3 :84 27 23 48 19 1 38 27 39

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

You are given a 0-indexed array of distinct integers nums.There is an element in nums that has the lowest value and an element that has the highest value. We call them the minimum and maximum respectively. Your goal is to remove both these elements from the array.A deletion is defined as either removing an element from the front of the array or removing an element from the back of the array.Return the minimum number of deletions it would take to remove both the minimum and maximum element from the array.