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

Unless explicitly mentioned, built-in functions or special forms should not be used. If you wish, however, you may implement helper functions

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., \# run_length_encode [a ' ;a '; 'a'; 'a'; a ' ; ' b '; 'b'; 'b' ]; - : (char * int) list =[(a,5);(b,3)] \# run_length_encode [1;1;6;6;6;6;2];; - :(int int) list =[(1,2);(6,4);(2,1)] \# run_length_encode []; - : ('a int) list =[] Your implementation should be tail recursive. You may assume that adjacent elements can be compared for equality using 7. run_length_decode : given a run-length encoded list argument, returns the original list. E.g., \# run_length_decode [(a,5);(b,3)];; - : char list =[a '; ' a '; ' a '; ' a '; ' a '; 'b'; 'b'; 'b' ]