You are given a sorted sequence of n integers S = s1, s2 ... sn and a sorted sequence of m integers Q = q1, q2 ... qm.Please print in ascending order all such si that belongs to Q.Input data specificationIn the first line you are given one integer 2 <= n <= 100, and in the following line n integers:-100 <= si <= 100, si <= si+1.In the third line you are given one integer 2 <= m <= 100, and in the following line m integers:-100 <= qi <= 100, qi <= qi+1.Output data specificationThe sequence of requested integers separated by spaces.ExampleInput:5-2 -1 0 1 46-3 -2 -1 1 2 3Output:-2 -1 1

The program must accept N integers as the input. The program must sort the N integers using selection sort and print all the iterations of the selection sorting process as the output.Boundary Condition(s):2 <= N <= 1001 <= Each integer value <= 1000Input Format:The first line contains N.The second line contains N integers separated by a space.Output Format:The lines containing all the stages of the selection sort.Example Input/Output 1:Input:512 6 15 9 10Output:6 12 15 9 106 9 15 12 106 9 10 12 156 9 10 12 15

Problem Statement:Write a program to accept 3 numbers as input and sequence them in the descending order. You may assume that the numbers will not be equal.Input Format:Three space Integes - num1, num2 and num3.Output Format:Display the three integers  in decreasing order - Integer>Integer>Integer.Constraints1<=num<=2,147,483,647Sample Input 16789 6790 6788Sample Output 16790>6789>6788Sample Input 20 1 2Sample Output 22>1>0

Problem StatementYou are working as a software engineer for a bus ticketing system. The system needs to handle ticket requests efficiently. Each request arrives at the system with a timestamp representing the time when the request was made. To process these requests in the correct order, you need to sort them by their timestamps before handling them.Your task is to write a program that reads a list of ticket request timestamps, sorts them in ascending order, and then prints the sorted list. The queue of ticket requests will be implemented using a linked list.Input format :The first line consists of an integer n, the number of ticket requests.The second line consists of space-separated integers, representing the request timestamp.Output format :The output displays integers, representing the sorted request timestamps on a single line, separated by spaces.Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:2 ≤ n ≤ 250 ≤ timestamp ≤ 100Sample test cases :Input 1 :419 29 12 18Output 1 :12 18 19 29 Input 2 :74 5 6 7 8 9 3 Output 2 :3 4 5 6 7 8 9 Input 3 :510 26 29 28 17Output 3 :10 17 26 28 29

Provided S - a set of n integers S = s1, s2, ..., sn. Check whether it is possible to divide S into two parts: s1, s2, ..., si and si+1, si+2, ..., sn (1 <= i < n) Remember that the first part is strictly decreasing while the second is strictly increasing one.Input FormatIn the first line you are given an integer 2<=n<=100 and in the following line n integers -100 <= si <= 100.Constraints2<=n<=100 -100 <= si <= 100Output FormatOne word Yes or No.Sample Input 05 -1 2 -1 1 -1Sample Output 0No

Problem Statement:Write a program to accept 4 numbers as input and sequence them in the descending order. You may assume that the numbers will not be equal.Input Format:Four space separated Integers - num1, num2, num3 and num4.Output Format:Display the four integers in the decreasing order - integer>integer>integer>integerConstraints1<=num<=2,147,483,647Sample Input 16789 6790 6788 6787Sample Output 16790>6789>6788>6787Sample Input 20 1 2 3Sample Output 23>2>1>0