In TypeScript

2. (33 pts) Write a function with 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]. You need a parameter so that the TAs can enter any number such as 100 or 1000 or 10000 , etc. (problem2 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 '. Use typescript. (This will be a separate .ts file named problem2.ts) problem 21000 [13,23,43,53,73,83,103,113,163,173,193,223,233,263,283,293,433,443,463,503,523,563,593,613,643,653,673,683,733,743,773,823,853,863,883,953,983]