For this assignment, you will be coding a MinHeap that is backed by an array of contiguous elements. Here is a tree and array representation of the same MinHeap: IMPORTANT: • You will be given 5 attempts on this assignment, with a 30 minute cooldown between submissions. • Please run your code before each submission to ensure that there are no formatting errors! If there are formatting errors in your code, your code will not be graded and a submission attempt will be logged. For more information, please review the Vocareum overview below. Properties A MinHeap is a type of binary tree with two main properties: Shape Property: The tree must be complete. All levels of the tree must be full except the bottom-most level. If the bottom-most level is not full, it must be filled from left to right with no gaps. • Order Property: Each node's data is smaller than the data in its children. There is no explicit relationship between sibling nodes. These properties guarantee that the smallest element in the heap will be at the root of the heap. Implementation Details Although heaps are usually classified as a type of tree, they are commonly implemented using an array due to their completeness. In your implementation, you should leave index 0 empty and begin your heap at index 1. This will make the arithmetic for finding parent and children indices simpler. When resizing your backingArray, double the current capacity. Therefore, if the initial capacity is 13, the first resize should bring the total backingArray capacity to 26. Note that this includes the oth index! You may assume that your implementation does not need to handle duplicate elements. That is, the add method will never be passed duplicates and the remove method will never have to deal with the heap having duplicates. To be clear, your implementation would most likely work even if we were to test for duplicates; however, this will help remove ambiguity surrounding grading and testing your implementation. Unlike your BST homework, you are not required to use recursion in this assignment. Use whatever you find most intuitive - recursion, iteration, or both. However, regardless of the technique you use, make sure to meet the efficiency requirements as discussed in this course.

Exercise 2.3. What is wrong with this procedure, which is supposed to return True if the element x occurs in the list items, and False otherwise? def member (x, items): for i in items: if x == 1: return True else: return False

Create a data type that allows you to insert, remove the maximum, and delete the minimum (all in logarithmic time), as well as locate the maximum and find the minimum (both in constant time). Use two piles as a hint.

Complete the docstring using the information attached (images):def upgrade_stations(threshold: int, num_bikes: int,                     stations: List["Station"]) -> int:    """Modify each station in stations that has a capacity that is less than    threshold by adding num_bikes to the capacity and bikes available counts.    Modify each station at most once.     Return the total number of bikes that were added to the bike share network.     Precondition: num_bikes >= 0     >>> handout_copy = [HANDOUT_STATIONS[0][:], HANDOUT_STATIONS[1][:]]    >>> upgrade_stations(25, 5, handout_copy)    5    >>> handout_copy[0] == HANDOUT_STATIONS[0]    True    >>> handout_copy[1] == [7001, 'Lower Jarvis St SMART / The Esplanade', \                            43.647992, -79.370907, 20, 10, 10]    True    """

*Data Structures and Algorithm

numbers: 13 18 72 26 62 74 Merge(numbers, 0, 2, 5) is called. Complete the table for leftPos and rightPos at the moment an element is copied into merged Numbers. mergePos leftPos rightPos 0 1 2 3 4 LO 5 0 Ex: 3 ŵ î î 3 ŵ Element copied to merged Numbers 13 18 26 62 72 74

Complete the dry run table for each fragment of code given in the question sub-parts that follow. Line numbers for use in the table are indicated by comments. Give the value(s) printed out when each is executed. Justify your answers by explaining in your own words the execution of the code.

PART A. We will start by finding the largest value.  Initially, we assume that the first element in the list is the largest element and create a variable maxValue that is  initialized to the first element in the array. We then compare the element that maxValue is storing with every  element in the list. Whenever we find an element in the array larger than the element that maxValue is storing,  we update maxValue so that it stores the value of the newer larger element. Algorithm ArrayLargestElement  Declare and initialize maxValue to the first element in the array.  Use a FOR loop to traverse the array.  // You already checked the first element, so you should start the loop at the second element.    If the element at this index is larger than maxValue    Update maxValue  Output maxValue.   Write a program MyArray_ABC that declares an array containing the following elements: 45, 38, 27, 46, 81, 72,  56, 61, 20, 48, 76, 91, 57, 35, and 78, and outputs the largest value.    Additionally,…

Avoid plagiarism

Overview This is a review assignment where you will use multiple tools you have picked up so far throughout the course. If you're confused about how to do something make sure you look back at earlier assignments. In this program you will start by declaring an empty dictionary named population_dict. Then you will use a while-loop to prompt a user for a series of cities and their populations, storing the input in population_dict). After this you will prompt the user to decide what is the maximum population for a city to be considers a small down. Finally, you will open a file called populationdata.txt where you will write the results. Expected Output Example of standard out (the console): What is next city? (enter q to quit) Long Beach What is the population of Long Beach? 362000 What is next city? (enter q to quit) Los Angeles What is the population of Los Angeles? 382000000 What is next city? (enter q to quit) San Diego What is the population of San Diego? 136000000 What is next city?…