4.2 Picking elements in a linked-list (20 points) NNNN NNNNNNN Write a function 'pickevery(1,n)' that takes a linked-list 'l' as input and returns every nth element in the list where 'n' is an input of your function. For example, 'pickevery([1,2,3,4],2)' should return [1,3]' and 'pickevery([1,2,3,4],3)' returns '[1,4]'. You can assume that the linked-list has a field 'head' that returns the first (sentinel) list cell in the list (as in the previous question). | # BEGIN SOLUTION | # END SOLUTION What is the worst case runtime complexity in Big-o notation of function "pickevery