Exercises should be completed using the OCaml programming language with code presented

4. merge: Takes two argument lists, both of which contain only integers and are in ascending order. Returns a single list containing all the integers, sorted in ascending order. E.g.t #merge[1;4;8;10][2;3;7;13];;-:intlist=[1;2;3;4;7;8;10;13] Your implementation should not be tail-recursive (we'll do that next). 5. merge_tail : re-implement the previous function, but this time your implementation should be tail-recursive. As with your implementation of concatenate, you may only use the : : constructor to build your result list, and it should have linear runtime w.r.t. the total number of integers. 6. run_length_encode : returns a run-length encoding of the argument list. Run-length encoding stores each value together with the number of times it appears (contiguously) - in this way, a value that is repeated multiple times can be more efficiently represented. E.g., Your implementation should be tail recursive. You may assume that adjacent elements can be compared for equality using =