IN HASKELL

Write a function using list comprehension and at least one helper function. Create a

list of prime numbers from 2 to n. For instance, the prime numbers from 2 to 20 would be

[2,3,5,7,11,13,17,19]. Parameter required, such as (problem1 n =). Filter out all numbers that ARE palindromes, in other

words do not output any palindromes. Only include numbers that have as a right digit '3'.

problem1 1000

[13,23,43,53,73,83,103,113,163,173,193,223,233,263,283,293,433,443,463,503,523,563,593,6

13,643,653,673,683,733,743,773,823,853,863,883,953,983]