How would you implement a dictionary of a reasonably small size n of you knew that all its elements are distinct (e.g., names of the countries in the world)? Specify an implementation of each dictionary operation.

The interchange implementation was supposed to be better than the transpose implementation as it implements the same algorithm without the need of copying the 640,000 elements. However, it is not. How do you explain this inconsistency?

Let us use the list [d1, d2, represent the (positive) big-integer d1d2...dn. dn], where each di is between 0 and 9, to type BigInt = [Int] For example, [9, 9, 9, 9, 9, 9, 9, 9, 9, 8] represents the big-integer 9999999998. Fill out the implementation for bigAdd : BigInt -> BigInt -> BigInt so that it takes two integer lists, where each integer is between 0 and 9 and returns the list corresponding to the addition of the two big-integers. Again, you have to fill in the implementation to supply the appropriate values to f, base, args. You should get the following behavior: ghci> bigAdd [9, 9] [1, 0, 0, 2] [1, 1, 0, 1] ghci> bigAdd [9, 9, 9, 9] [9, 9, 9] [1, 0, 9, 9, 8]

Produce a column-based (dict[str, list[str]] table given the first N(a parameter) rows  In python cannot use pandas, iloc, head, or .df  loop through the first N iterms of the tables columns assign the produced list of column values to the empty dictionary  finally return the dictionary  for example: if we have a dataframe of colors, people, and cars colors = {pink, blue, green, yellow, white} people = [marc, max, maria, lauren, emma} cars = {suv, sedan, coupe, off-road, luxury} the function given a N parameter such as 2. will return a table of color = {pinl, blue}, people = {marc, max}, cars = {suv, sedan}

ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1​,N2,⋯​ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…