Haskall programming language

Create a function named problem1. Use a list comprehension for the main function. This function will take a single integer parameter. It indicates the number of primes that will be the final list. The final solution will output a list of every other prime. problem1 10 --> [2,5,11,17,23,31,41,47,59,67] problem1 7 --> [2,5,11,17,23,31,41]

Create a function named problem2. Use recursion to solve this problem. This function will take a single integer parameter. It indicates the maximum value of Fibonacci numbers that will be in the list. The final solution will be a list of Fibonacci numbers that have a three as their right-most digit and are less than or equal to n. (For this problem, Fibonacci starts 1,1,2,) problem2 100 --> [3,13] problem2 10000 --> [3,13,233]