Resolve using the Haskell programming language.

3. run_length_encode is the same as on HW1, but this time you'll implement it with higher-order functions instead of recursion. 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.r You may assume that adjacent elements can be compared for equality using =. 4. run_length_decode is the same as on HW1, but this time you'll implement it with higher-order functions instead of recursion. 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' ]