What will be printed out after the code fragment executes, assuming that s is empty Stack and q is empty Queue? S. push ("Alice") ; s.push ("Dick"); 3. push ("Philip"); s.push ("Dustin"); s.push ("Mark") ; while (!s.empty ()) q.offer (item) ; while (!q.isEmpty ()) System.out. print (q. remove () + " ") ; A. Alice B. Mark Dustin Philip Dick Alice C. Alice Dick Philip Dustin Mark D. nothing will be printed What is the time complexity of the following method? public static int mystery(int n ) ( if (n