Trace thru the following recursive algorithm and print the result. public static void mystery (int n X 4. if (n -0) return System.out.printing n ) mystery( n-1); public static void main( int [ args K mysteryf 10 ) Answer C. Complete the recursive function to return a list that consists of the negative numbers of a given list (e.g. negatives ((6, 3,-4, 9, -11,-2, 5]) will return [-4,-11, -21) def negatives(lst): if return else: if return else: return