write a Boolean function in F# programming language named indexWiseGreater that receives two list of inger values of the same length and check if the elements of the first list are greater than or equal to the elements of the second list indexwise. Here, you can find some examples of this two lists element-wise comparison: indexWiseGreater [2;6;8;1] [1;5;3;2] val it : bool = true indexWiseGreater [8] [4;5] System.Exception: different lengths indexWiseGreater [2] [0] val it : bool = true indexWiseGreater [2;5;6] [-1;0;7] val it : bool = false   let rec indexWiseGreater lst1 lst2 = match lst1, lst2 with

In c++, how do I display the last node in a linked list?

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

In Ocaml Map functions left Write a function map_fun_left : (’a -> ’a) list -> ’a list -> ’a list = that is given a list of functions and a list of elements. For each element apply all functions from left to it and keep the result. Return the results as a list.  examplesmap_fun_left [((+) 1) ;( * ) 2; fun x - >x -10] [1;2;3;4];;- : int list = [ -6; -4; -2; 0]map_fun_left [( fun x - > int_of_char x | > (+) 32 | >char_of_int ) ;( fun x - > char_of_int (( int_of_char x )+1) ) ] [ ’A ’; ’B ’; ’C ’; ’D ’];;- : char list = [ ’b ’; ’c ’; ’d ’; ’e ’]

JavaScript Given a singly linked list of integers, determine whether or not it's a palindrome. // Singly-linked lists are already defined with this interface: // function ListNode(x) { // this.value = x; // this.next = null; // } // function isListPalindrome(head) { }   Note: in examples below and tests preview linked lists are presented as arrays just for simplicity of visualization: in real data you will be given a head node l of the linked list Example For l = [0, 1, 0], the output should beisListPalindrome(l) = true; For l = [1, 2, 2, 3], the output should beisListPalindrome(l) = false.

In C++.

Write a function cmid to count elements of an integer list between 5 and 10. One function only.cmid [12,3,6,4,5,1] → 2

lst1= [4,3,2,6,2] and lst2=[1,2,4] then the new_list is [2,2,4]. Assign the new-list to variable new_list and sort. Code: What is wrong with this code? lst1= [4,3,2,6,2]  lst2=[1,2,4] new_list=[] for elements1 in lst1:    for elements2 in lst2:        elements1==elements2:        new_list.append(elements1)       new_list.sort()

C++ Create a generic function increment(start, stop, x) that adds x to every element in the range [start,stop). The addition is done using the + operator. The arguments start and stop are bidirectional iterators. Write a test driver.

Consider the following function access_element_by_index that returns the iterator to the element at the index i in the list l.   typedef std::list<int> int_list; int_list::iterator access_element_by_index(size_t I, int_list &) {        assert( ? );        … }   Assume the first element of the list is at the index 0, the second at the index 1, and so on. If the function is required to return an iterator that can be dereferenced, determine the precondition of the function, and write an assertion to validate it. (You don’t need to implement the functions).