Complete the docstring below using the helper function and information attached:   def get_last_syllable(word_phonemes: PHONEMES) -> PHONEMES:    """Return the last syllable from word_phonemes.     The last syllable in word_phonemes is formed from the last vowel phoneme    and any subsequent consonant phoneme(s) in word_phonemes, in the same    order as they appear in word_phonemes.     >>> get_last_syllable(('AE1', 'B', 'S', 'IH0', 'N', 'TH'))    ('IH0', 'N', 'TH')    >>> get_last_syllable(('IH0', 'N'))    ('IH0', 'N')    >>> get_last_syllable(('B', 'S'))    ()    """

Modify the following program  to read dictionary items from a file and write the inverted dictionary to a file:   characters = {'Bugs':['Rabbit', 1940, 'boy'], 'Garfield': ['Cat', 1978, 'boy'], 'Tweety': ['Bird', 1942, 'girl'], 'Sandy': ['Squirrel', 1999, 'female']}   print("Printing the original dictionary")   print(characters)   print("")   def invert_dict(characters):     inverse = dict()     for key in characters:         val = characters[key]         for list_item in val:             if list_item not in inverse:                 inverse[list_item] = [key]             else:                 inverse[list_item].append(key)         return inverse   my_invert = invert_dict(characters)   print("Printing the inverted dictionary")   print(my_invert)   Include the following: 1) The input file for your original dictionary (with at least six items).2) The Python program to read from a file, invert the dictionary, and write to a different file.3) The output file for your inverted dictionary.…

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.

15.14 LAB: Binary search   Binary search can be implemented as a recursive algorithm. Each call makes a recursive call on one-half of the list the call received as an argument. Complete the recursive function BinarySearch() with the following specifications: Parameters: a target integer a vector of integers lower and upper bounds within which the recursive call will search Return value: the index within the vector where the target is located -1 if target is not found The template provides the main program and a helper function that reads a vector from input. The algorithm begins by choosing an index midway between the lower and upper bounds. If target == integers.at(index) return index If lower == upper, return -1 to indicate not found Otherwise call the function recursively on half the vector parameter: If integers.at(index) < target, search the vector from index + 1 to upper If integers.at(index) > target, search the vector from lower to index - 1 The vector…

15.14 LAB: Binary search   Binary search can be implemented as a recursive algorithm. Each call makes a recursive call on one-half of the list the call received as an argument. Complete the recursive function BinarySearch() with the following specifications: Parameters: a target integer a vector of integers lower and upper bounds within which the recursive call will search Return value: the index within the vector where the target is located -1 if target is not found The template provides the main program and a helper function that reads a vector from input. The algorithm begins by choosing an index midway between the lower and upper bounds. If target == integers.at(index) return index If lower == upper, return -1 to indicate not found Otherwise call the function recursively on half the vector parameter: If integers.at(index) < target, search the vector from index + 1 to upper If integers.at(index) > target, search the vector from lower to index - 1 The vector…

Q1)Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm. Q2)Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. Write the mathematical process to find the missing number, i.e. some equation. What is the time complexity of finding the missing number in the sequence? Q3)Sort the text “SARHAD UNIVERSITY” in ascending order using the insertion sort algorithm. Discuss also the best, worst and average case complexity of the…

g. Include a delete() function in LinearProbingHashST that deletes a key-value pair by changing the value to null (while leaving the key in place) and then deleting the pair from the table in resize(). The most difficult decision you must make is when to use resize(). Note: If a future put() action associates a new value with the key, you should replace the null value. Make sure that while deciding whether to enlarge or shrink the table, your programme takes into consideration both the number of such tombstone items and the number of vacant places.

Please use python codes and don't copy from previous answers. 3.) Consider the matrix list x = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]. Write a list comprehension to extract the last column of the matrix [3, 6, 9]. Write another list comprehension to create a vector of twice the square of the middle column [8, 50, 128].

python code. define the run function. Instructions are given within the quotations. 1)def invert_dict(d): """ Given a dictionary d, create the invert of the dictionary where the key is a value v in d, and v is mapped to a set of keys in original d whose values are equal to v. Return the inverted dictionary mapping value to set of keys """ 2)def histogram(words): """ Given a list of words, create a histogram dictionary where the key is the length of a word and the value is the count of how many words in the list are of that length. Return the histogram dictionary mapping length to word counts """ 3)def max_kv(d): """ Given a dictionary, return a tuple of key value pair where the key is the largest in d. """ 4)def run(): """ Get words list from the file listed in argv[1]; create histogram of count of each word length; create invert dictionary that maps count to list of word length; use invert dictionary to find the list of word length with the most popular word count (use max_kv) """…