Create a function named primeo2. Use a list comprehension for the main function (remember, for Python there can be set up and the main function can be a local 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. (Please note that primes start at 2.)

primo2 10 -> [2,5,11,17,23,31,41,47,59,67]

primo2 7 -> [2,5,11,17,23,31,41]