Write a lisp function f8 that returns the sum of all integers everywhere in a list. Example: (f8 ‘(2 (5 4) 3 (2 (1 10)) 5)) returns 32 THIS FUNCTION CAN ONLY USE CAR CDR AND + AND RECURSION NO OTHER FUNCTIONS MAY BE USED

in c++

C++

Write The code for a basic recursive quicksort member function.

Question: First write a function mulByDigit :: Int -> BigInt -> BigInt   which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1]   Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt   Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] []   Your implementation should not be recursive.     Code:  import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…

void listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **

in #lang scheme

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

Suppose a node of a linked list is defined as follows in your program:    typedef struct{  int data;  struct Node* link;  } Node;    Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.

Suppose a node of a doubly linked list is defined as follows:  struct Node{  int data;  struct Node* next;  struct Node* prev;  };  Write the function definition of the function deleteElement as presented below. This function deletes a node at position n from a doubly linked list.  struct Node* deleteElement(struct Node* head, int n){  //write the function definition  }