In 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!Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

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.

Problem StatementArun is given an array of integers where all elements appear twice, except for one element that appears only once. The goal is to find this single, non-duplicate element using a linear search algorithm. If the element is not found, print the appropriate message.Assist Arun in solving this challenge.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 single non-duplicate element in the given array.If no such element is found, print "No non-duplicate element found".Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 151 ≤ elements of the array ≤ 30Sample test cases :Input 1 :91 1 2 3 3 4 4 8 8Output 1 :2Input 2 :712 16 12 15 17 16 15Output 2 :17Input 3 :414 26 14 26Output 3 :No non-duplicate element found

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 :

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

Write a program to read and store n+ve numbers in array and search a number k provided by the user using a. Linear Searchb. Binary Search