Haskell question

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]