Write a function in Ocaml. count123 : int list -> int*int*int that takes in an int list l and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in l. For example, count123 [3;4;2;1;3] = (1,1,2), and count123 [4;4;1;2;1] = (2,1,0). let count123 l = (* YOUR CODE HERE *)

Language: Python 3 Autocomplete Ready O 4. Pair Of Elements having Smallest Absolute Difference 1 v import ast lst = input() 2 3 lst = ast.literal_eval (lst) 4 Given a list of unsorted integers. Find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. 5 6 print(smallest_absdiff_pairs(lst)) Implement a function smallest_absdiff_pairs that take a list of numbers and returns a list of pair of elements that have the smallest absolute difference between them. >>> smallest_absdiff_pairs([5, 4, 3, 2]) [(2, 3), (3, 4), (4, 5)] >>> smallest_absdiff_pairs([-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854, -520, -470]) [(-520, -470), (-20, 30)] >>> smallest_absdiff_pairs([-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854]) [(-20, 30)]

Write a function val nextpascalrow : int list -> int list = <fun> that given a list of integers that correspond to a row of the pascal triangle, it calculates the next row of the pascal triangle. # nextpascalrow [1; 6; 15; 20; 15; 6; 1];; - : int list = [1; 7; 21; 35; 35; 21; 7; 1]

OCAML Problem

Write a function in Ocaml oddfirst : int list -> int list = that takes a int list and returns the same list, but where all odd numbers come before the even numbers

# viewGame(G, i) takes a game description G (a dictionary of the type# produced by newGame()) and an integer player index i and returns a# string that, when printed, describes the state of the game from# player i's perspective.## Example:# >>> viewGame(G, 1)# '\nPlayer2 to play (score=0):\n 1[ ] 2[ ] 3[ ]'## Note the spacing and explicit newlines, and the fact that the player# numbers use 1-based indexing even though internally the game data# structures use Pythonic 0-based indexing.

Problem 1 Write a function count 123 : int list -> int * int * int that takes in an int list 1 and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in 1. For example, count123 [3; 4;2;1;3] = (1,1,2), and count123 [4; 4; 1; 2; 1] (2,1,0). In [] let count 123 1 = (* YOUR CODE HERE *) In [ ]: assert (count123 [3; 4; 2; 1;3] = = (1,1,2))

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.

Code in Python: