N SCALA PLEASE Implement a polymorphic function remove1, which removes a single element from a list (if this element is present in the list). For example remove1(List(1,2,3,2,1), 0) => List(1, 2, 3, 2, 1) remove1(List(1,2,3,2,1), 2) => List(1, 3, 2, 1) You should only remove at most a single occurrence of an element from the list. This function should work for lists of intergers but also lists of chars. The CODE: object Test { import io.Source import scala.util._   def remove1[A](xs: List[A], elem: A) : List[A] = ???   }

Write a C code that will search an int type target from a dynamic linked list. The linked list contains int type values inside each of the nodes. The “search” function will use following input-output arguments,Input: Pointer to the head of the list that you are searching Target value that you are searchingOutput: Pointer to the node that contains the target if found or, NULL if not found.

IN PYTHON PLEASE Write a function def sameSet(a, b) that checks whether two lists have the same ele- ments in some order, ignoring duplicates. For example, the two lists 149 16 9 7 4 9 11 and 11 11 7 9 16 4 1 would be considered identical. You will probably need one or more helper functions.

Python Please Define a function max_run(lst: list) -> int to find the maximum run in a list. A run is a subsequence with identifical values. For example, in [1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4], the runs are [1, 1], [2, 2], [3], [4, 4, 4], [2], and [4, 4]. The longest run is [4, 4, 4], which has 3 elements. max_run([1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4]) should return 3. max_run([]) == 0, max_run([1, 2, 3]) = 1, and max_run([1, 2, 1, 1]) = 2.

Please finish this problem in OCaml. Please implement two functions: string_explode : string -> char list string_implode : char list -> string string_explode turns a string into a list of characters and string_implode turns a list of characters back into a string. To implement these two functions, use a selection of the following higher-order functions: List.map, List.fold_right, List.fold_left and tabulate. tabulate is implemented for you in the prelude. You may also find the following functions from the OCaml string and char libraries useful: String.get : string -> int -> char returns the character at index n in string s. String.length : string -> int returns the length (number of characters) of the given string. Char.escaped : char -> string returns the string representation of the given character In order to get full marks for each question, you must use higher-order functions. Solutions using manual recursion will be capped at half marks. Please follow the…

In CPP,   Modify the arrayListType by adding a member function that keep the first element in the list as is and replace subsequent elements by the result of subtracting the element from the first element. This member function returns the first element in the list. For example, if the list L contains the elements 2,1,3,4,5,3,0 and you call the member function as in L.differentiate (); The list content will then be changed to 2,1,-1,-2, -3,-1,2 And the function returns 2. The list should not be empty.

Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k)   Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.