I need to create the functions for both union and merge Linked List.

import json, datetime, csvfrom pprint import pprint   Question 3    - Using the cleaned list of lists from question 1, create a dictionary of dictionaries      where each key in the outer dictionary is an author whose last name starts with the letter 'S'.    - Each inner dictionary should contain the number of books that author has written as 'Number of Books'    - It should contain the earliest book title for that author based on year with the key 'First Book'    - Finally it should contain the latest book title for that author based on year with the key 'Last Book'    - If an author has only one book put the same title in both places    - Return the dictionary of dictionaries def author_history(cleaned_list):     Args:        cleaned_list (list)    Returns:        dictionary of dictionaries     Output:        {'SafranFoer,Jonathan': {'First Book': 'ExtremelyLoudandIncrediblyClose',                                  'Last Book': 'ExtremelyLoudandIncrediblyClose',…

What description to Array and Linked List is mistake? O a. Using Linked list, if there is a existed data will be removed, it needs only to move the links of data node and doesn't need to change the location of data saved. O b. Using Linked list, if there is a new data will be increased, it needs only to move the links of data node and doesn't need to change the location of data saved. O c. If the size of main memory is enough, there is no upper bound limitation to increase new data when Linked list is used. O d. For limited number of data, Array is allocated less memory size, because all sequential data are allocated into continuously space. O e. Using Array, if there is a new data will be increased, it needs to move some existed data to new location to free the suitable location new data because the sequential order should be kept. O f. If the size of main memory is enough, there is no upper bound limitation to increase new data when Array is used. O g. The operations on Array is…

Do this using C++ language using structures and singly linked list.

Write a struct ‘Student’ that has member variables: (string) first name, (int) age and (double) fee. Create a sorted (in ascending order according to the age) linked list of three instances of the struct Student. The age of the students must be 21, 24 and 27. Write a function to insert the new instances (elements of the linked list), and insert three instance whose member variable have age (i) 20, (ii) 23 and (iii) 29. Write a function to remove the instances from the linked list, and remove the instances whose member variables have age (i) 21 and (ii) 29. Write a function to count the elements of the linked list. Write a function to search the elements from the linked list, and implement the function to search an element whose age is 23. Write a function to print the linked list on the console. Consider the Student struct as defined above. Create a stack of 5objects of the class. Implement the following (i) push an element to the stack (ii) pop an element from the stack (iii) get the…

List data_list contains integers read from input, representing a sequence of data values. For each index i of data_list from 1 through the second-to-last index: The element at index i is a drop if the element is less than both the preceding element and the following element. If the element at index i is a drop, then output 'Drop: ', followed by the preceding element, the current element, and the following element, separating each element by a space.

Write a function called list_to_dict(lst) that takes a 2-D list of sales records of this form.[["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75]]Your function will store the sales information in a dictionary, where each {key:value} pair of the dictionary stores {a unique customer: [ a list of all products purchased by this customer, total cost of these products]}, and returns the dictionary.   Sample run,sales = [ ["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75],["customer2", "milk", 4.35], ["customer3", "egg", 3.6], ["customer4", "bread", 4.5],["customer1", "milk", 4.35], ["customer2", "egg", 3.6], ["customer4", "milk", 4.35] ]>>> record = list_to_dict(sales)>>> display(record)customer1 : [['bread', 'egg', 'milk'], 16.1]customer2 : [['bread', 'milk', 'egg'], 12.45]customer3 : [['egg'], 3.6]customer4 : [['bread', 'milk'], 8.85]

Please answer the ques in python with showing code

Please help me write the following function (see the photos for context of the problem): follow_trail(filename, treasure_map, start_row, start_col): Takes as inputs a string corresponding to a filename, a list of lists corresponding to a treasure map, and two non-negative integers representing a row and column index. Follows the trail in the given treasure map, starting at the given row and column index. Following the trail means to look at each character of the trail and perform the appropriate operation for that character: '>', '<', 'v', ' ∧': Continues following the trail by moving to the character to the right, left, below or above the current trail character, respectively. '.': Creates a new map file, with 'new_' prepended to the current map filename, and stores the same treasure map but with an X at the current position. Then, returns a tuple of three elements: the first being -1, and the latter two being the current row and column index. '*': Returns a tuple of three…

The procedure BinarySearch (numList, target) correctly implements a binary search algorithm on the list of numbers numList. The procedure returns an index where target occurs in numList, or -1 if target does not occur in numList. Which of the following conditions must be met in order for the procedure to work as intended? A The length of numList must be even. B The list numList must not contain any duplicate values. The values in numList must be in sorted order. D The value of target must not be equal to -1.