Write the polynomial function, which takes a list of tuples and returns the polynomial function corre- sponding to that list. Each tuple in the input list consists of (i) the coefficient, and (ii) the exponent. # (* below is the polynomial function f(x) = 3x^3 - 2x + 5 *) # let f = polynomial [3, 3; -2, 1; 5, 0];; val f : int -> int = # f 2;; - : int = 25

Look at the two functions Merge-and-Count & Sort-and-Count. You are also given an array- Awesome_Array= 3 7 10 14 18 19 2 11   Merge-and-Count (A, B){      curA = 0; curB = 0;      count = 0;      mergedList = empty list      while (not at end of A && not at end of B){             a = A[curA];             b = B[curB];             if (a < b)                 append a to mergedList;                 curA++;             else                  append b to mergedList;                  curB++;                  count = count + number of elements left in A        }       if (at end of A)           append rest of B to mergedList;       else            append rest of A to mergedList;              return (count, mergedList); }     Sort-and-Count(L){          if list L has one element             return (0, L)          Divide the list into two halves A and B        (rA, A) ← Sort-and-Count(A)        (rB, B) ← Sort-and-Count(B)        (rC, L) ← Merge-and-Count(A, B)        total_count =…

Question 5 Write the code for the function printRoster, it should print out the contacts in a format similar to the example. You can use a range-based for-loop and auto to simplify the solution, if you wish. #include #include #include #include #include using namespace std; void printRoster(map>>& roster) { // Fill code here int main() { map>> roster; roster["ELCO"]["CS-30"]. emplace_back("Anthony Davis"); roster["ElCo"]"cS-30"j. emplace_back("Talen Horton-Tucker"); roster["ElCo"Ï"BUS-101"].emplace_back("LeBron James"); roster["SMC"]["CHEM-101"].emplace_back("Russell Westbrook"); printRoster(roster); return 0; Here is the sample output: ElCo BUS-101: LeBron James CS-30: Anthony Davis Talen Horton-Tucker SMC CHEM-101: Russell Westbrook

Question 1: Faro Shuffle A faro shuffle involves splitting a deck of cards into two piles, then taking cards exactly alternating between the two piles. Write a function (faro-shuffle lst0 lst1),which consumes two (listof Any). The function produces a list which contains all the items in 1st0 and 1st1, interleaved. That is, the first item in the result is the first item from 1st0, the second is the first item from 1st1, the third is the second item from 1st0, the fourth is the second item from 1st1, and so on. If 1st0 and 1stl are not of equal length, the extra items should be included at the end. Here are some examples: 1 (check-expect (faro-shuffle (list "a" "b" "c") (list "A" "B" "C")) (list "a" "A" "b" "B" "c" "C")) 3 (check-expect (faro-shuffle (list 1 3 5) (list 2 4 6 8 10)) (list 1 2 3 4 5 6 8 10)) 2 4 Submit your solution in the file a06q1.rkt.