Problem StatementDuring a routine software testing session, Alex and Jordan discovered several bugs in two separate versions of their application. They decide to merge and sort the lists of bugs from both versions and identify the most common bugs affecting the software. Given the number of bugs in each version and their identifiers, help them find and list the most common bugs.ExampleInput:3101 102 1032102 103Output: 102 103Explanation: After sorting and merging the bug reports from both versions, the list becomes: {101, 102, 102, 103, 103}.Now, analyze the frequency of each bug type in the merged list:Bug type '101' occurs once.Bug type '102' occurs twice.Bug type '103' occurs twice.Both bug types '102' and '103' are the most common, each occurring twice. Therefore, the output includes both of these bug types in ascending order: '102' followed by '103'. Input format :The first line of input consists of an integer n, representing the number of bug reports in the first version.The second line consists of n integers, each representing a bug report in the first version.The third line consists of an integer m, representing the number of bug reports in the second version.The fourth line consists of m integers, each representing a bug report in the second version.Output format :The output prints the most common bug types in ascending order.Refer to the sample output for formatting specifications.Code constraints :1 ≤ n, m ≤ 10100 ≤ bug type ≤ 1000Sample test cases :Input 1 :3101 102 1032102 103Output 1 :102 103 Input 2 :2201 2025201 202 202 203 204Output 2 :202 Input 3 :5501 502 503 503 5035501 502 503 505 506Output 3 :503

Problem StatementAgalya oversees a logistics system that tracks shipments via unique package identifiers. These identifiers are meticulously organized in a sorted array. Her objective is to enhance the system's efficiency in pinpointing packages that are logged an odd number of times (such as 3, 5, 7, etc.), which indicates potential discrepancies in the shipment data. Agalya seeks assistance in developing a program that employs a binary search algorithm, known for its efficacy in handling sorted data. This program will specifically target and display any package identifier that appears an odd number of times, thereby expediting the process for the logistics teams to identify and address any anomalies in the shipment records.Input format :The first line of input consists of an integer N, representing the number of packages in the shipment.The second line consists of N space-separated integers, representing the list of package identifiers.Output format :The output prints an integer representing the package identifier that occurs an odd number of times.Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 101 ≤ package identifier ≤ 100Sample test cases :Input 1 :717 25 38 38 38 62 79Output 1 :38Input 2 :641 41 41 41 41 72Output 2 :41

Exp the following algorithmsFind() Search() Sort() Merge() For_each() with example program

You are given an array of integers. Sort them by frequency. See examples for more clarifications.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains N - the size of the array. The second line contains the elements of the array.Output FormatFor each test case, print the elements of the array sorted by frequency. In case 2 elements have the same frequency, print the smaller element first.Constraints1 <= T <= 1001 <= N <= 10000-1000 <= A[i] <= 1000ExampleInput264 -2 10 12 -8 48176 -272 -272 -45 269 -327 -945 176Output-8 -2 10 12 4 4-945 -327 -45 269 -272 -272 176 176

hich of the following problems should be solved using dynamic programming? Mergesort  Binary search Longest common subsequence Quicksort

Duplicate elements removalIn an office the administration department has faced a glitch in their database which made all the duplicate backup. Write a program to help them clear all the dulpicate data from the list of data using the set and sort the unrecurred data Constraints:Input format :List of elements (Elements can only be  integers)Output format :Print the list with not duplicate elements