Implement the following function. Hint: You should use a dictionary. def word_pattern (pattern: str, words: List [str]) -> bool: "Given a pattern and a word list, determine if the word list follows the same pattern. That is to say, ensure that pattern [j] == pattern [k] only when words [j] == words [k] pattern [j] != pattern [k] means words [j] != words [k] Precondition: Assume pattern is all lowercase letters. >>> word_pattern ('aaaa', ['cat', 'cat', 'cat', 'cat']) Tuu and

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

Alert dont submit AI generated answer. please explain in details. Please print fixlist function so it would print out both lists a = [1, 5, 3, 6] b = [3, 5, 3 ,2, 4, 6, 8, 5, 2] def printList(list): for i in range(9): print(list[i]) print("End of List" print list(a) printList(b)     Expected output: 1 5 3 6 End of List 3 5 3 2 4 6 8 5 2

def reverse_list (1st: List [Any], start: int, end: int) -> None: """Reverse the order of the items in list , between the indexes and (including the item at the index). If start or end are out of the list bounds, then raise an IndexError. The function must be implemented **recursively**. >>> lst ['2', '2', 'v', 'e'] >>>reverse_list (lst, 0, 3) >>> lst ['e', 'v', 'i', '2'] >>> lst [] >>>reverse_list (lst, 0, 0) >>> lst [0] >>> Ist = [] >>> reverse_list (lst, 0, 1) Traceback (most recent call last): IndexError #1 #1

python Using try/except block and a for loop

Implement the build_dictionary() function to build a word frequency dictionary from a list of words. Ex: If the words list is: ["hey", "hi", "Mark", "hi", "mark"] the dictionary returned from calling build_dictionary(words) is: {'hey': 1, 'hi': 2, 'Mark': 1, 'mark': 1} Ex: If the words list is: ["zyBooks", "now", "zyBooks", "later", "zyBooks", "forever"] the dictionary returned from calling build_dictionary(words) is: {'zyBooks': 3, 'now': 1, 'later': 1, 'forever': 1} The main code builds the word list from an input string, calls build_dictionary() to build the dictionary, and displays the dictionary sorted by key value. Ex: If the input is: hey hi Mark hi mark the output is: Mark: 1 hey: 1 hi: 2 mark: 1

Implement the build_dictionary() function to build a word frequency dictionary from a list of words. Ex: If the words list is: ["hey", "hi", "Mark", "hi", "mark"] the dictionary returned from calling build_dictionary(words) is: {'hey': 1, 'hi': 2, 'Mark': 1, 'mark': 1} Ex: If the words list is: ["zyBooks", "now", "zyBooks", "later", "zyBooks", "forever"] the dictionary returned from calling build_dictionary(words) is: {'zyBooks': 3, 'now': 1, 'later': 1, 'forever': 1} The main code builds the word list from an input string, calls build_dictionary() to build the dictionary, and displays the dictionary sorted by key value. Ex: If the input is: hey hi Mark hi mark the output is: Mark: 1 hey: 1 hi: 2 mark: 1

Complete the doctring.def average_daily_temp(high_temps: List[int],                       low_temps: List[int]) -> List[float]:    """high_temps and low_temps are daily high and low temperatures for a series    of days. Return a new list of temperatures where each item is the daily    average.     Precondition: len(high_temps) == len(low_temps)       >>> average_daily_temp([26, 27, 27, 28, 27, 26], [20, 20, 20, 20, 21, 21])    [23.0, 23.5, 23.5, 24.0, 24.0, 23.5]    """

Assume, you have been given a dictionary where the keys present the name of the father and the value is a list of names of the sons of that person. For example A has 3 sons namely X, Y, and Z. Again X has three sons namely E, F, and G. So, A is the grandfather of E, F, and G. family = {"A" : ["X", "Y", "Z"], "B": ["M", "N"], "W" : ["A", "B"], "X" : ["E", "F", "G"]} You need to write a code which takes an input and prints the names of all his grandsons in the format shown in output samples. If he does not have any grandchildren just print “Get your sons married first! Wanna_be_grandpa!!” You can assume the input will always be a key from the dictionary. But we will check your code with a different dictionary. So do not write a code for this particular dictionary only.                 Enter                       Assume, you have been given a dictionary where the keys present the name of the father and…

In python make a function with the parameter of a dict[str, str] the function will simply invert the dictionary  do not use .get, .item, .values, or import builtins If you encounter more than one of the same key when trying to invert the key and value, raise a keyerror for example ['john': 'white', 'garcia': 'white'], should trigger the raise KeyError call