Create two Arrays A with 10 unsorted integer elements and B with 10 unsorted floatelements. Find the largest element in A and B and then sum both of them calling afunction SumAB() by reference. Sort A and B and then call another function StichAB()to merge B with A. Be careful about memory leakage.

Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0,  6)"*           9, 15, 22, 38, 7, 8, 14       7, 8, 9, 14, 15, 22, 38       9, 8, 14, 7, 22, 15, 38       9, 8, 7, 14, 22, 15, 38       7, 9, 15, 22, 38, 14, 6       38, 22, 15, 14, 9, 8, 7

Assume you have an array and a linked-list that each contain a list of 10 books. Which of the following is true? Group of answer choices 1. It is faster to access the 5th book in the array than to access the 5th book in the linked-list because arrays allow for directly accessing the appropriate spot in memory, while a linked list requires stepping through the previous 4 elements. 2. Shuffling the order of the Books in the linked-list will be easier than for the array. 3. It is faster to add a new book to the end of the linked list than to the array, because the entire array needs to be copied to a larger space in memory in order to add a new element. 4. All options are true.

Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.

PLEASE SCREENSHOT AND UPLOAD SUCCESSFUL OUTPUT (IN PYTHON ). Assuming the test cases you create in a file is the survey result. Write a program to read the file. In general, the number of records is unknown, the program should be able to process any number of records without abnormal termination. You may declare a large static array or declared a dynamic array after the number of records is known. After data is read, perform the analysis of the following: 1. Count the total number of households included in the survey. Obtain the average, minimum, maximum and median of household incomes, and print them out. 2. Sort the records of households by four-digit id numbers 3. Print all sorted household records as a three-column table, displaying the data for each household. Include heading for the table. 4. Determine the households that have incomes below the poverty level and print the record of all such households. Include heading for the table. All output should be formatted. Then print the…

Write a program that will load 100 integers into array X. Separate the even from the odd valued elements. The procedure should place the even values in ascending order starting from the first location of the original array and place the odd values in ascending order starting from the last position of the original array.

Using the provided MinHeap implementation & helper functions, build two sorted arrays as follows: Option 1:Given an unsorted array, build a sorted array in ascending order utilizing a minheap. Hint: this one is quite easy.. Load a minheap with your unsorted array. From there you can get the min element from the minheap & build your sorted array. Option 2:Given your unsorted array loaded into a maxheap.. Using this max-heap, in which the root node contains the largest element, build a sorted array in ascending order. To achieve this you’ll ‘Float’ the max to the front and build the sorted list from the back. The basic idea is to sort in place.     - Every time the algorithm polls from the heap, the heaps size shrinks by one.     - Hence, the next place at the end of the array is not part of the heap anymore.     - At this index the n-th smallest number is placed.    Final Solution should look like:   Array to be sorted by MinHeap: [5, 3, 17, 10, 84, 19, 6, 22,…