Indicate ALL syntax errors of each SML statement and try to correct.   Eg. [3, 1=2] answer 1 => type mismatch for a list, 3 has to be boolean. answer 2 => type mismatch for a list, 1=2 has to be int such as 1+2.  answer 3 => different type of values, can not be list, tuple instead (3, 1=2) (1)  val x = if (hd (false)) then tl ([1,2.0]); (2) val L = [[hd, tl], [tl, hd, hd]];

1-Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate? 2-insert(int index, int element): adds this element to the index position. For example, if index is 4, it adds this element between index 3 and 4 in the list. The size of the list has increased by one. 3-append(int elem): Adds the element to the end of the list. The size of the list has increased by one. 4-get(int index): Returns the element at the index position of the list, no change in the list. 5-remove(int index): Returns the element at the index position of the list. This element is removed from the list and the list size is reduced by one. 6-findMin(): returns the index of the smallest number in the list. 7-findMax(): returns the index of the largest number in the list. 8-search(int elem): searches elem in the list. It returns -1 when you can't find elem's index when you find it. 9-ToArray(): Return an…

def print_categories(main_list):    for i in all_categories:         main_list = all_categories.split()         print(i,":",all_categories[i])    return ""     """    Given a list of lists, for each list    stored in main_list, output its contents    as follows: f"{index of category}. {item[0]} - {item[1]}%".    note that indexing must start at 1 for the first item,    not 0, which is first item's actual index in main_list.    If `main_list` is empty, the function prints    "There are no categories."    Returns the number of categories.

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; };