Consider the incomplete Scala definition where some types have been replaced with numbered question marks. det ? ^) ( 21, 72) 73 - ( 2 Which types must replace ?1, 22, and ?3, for this definition to typecheck correctly? 21 = List[A), 22 = List[A], 23 = List[A] 21 = List[A), ?2 - List(A), 23 - A O21 - A, 22 = A, 23 - A ?1 = List[A), 72 - A, 73 - List[A] 21 = A, 22 = List[A], 23 - List[A] Consider the following incomplete Scala definition. def foo [A, B] (ORI List[List[A). f1) + 71 - for (x - * * - XN) yield f (x) ) Which of the following expressions gives the same result as running foo (xss, f) for all xss, f? xss.map (xs=>xs.map(f)).flatten xss.map(f) xss.map(f).flatten xss.map(xs=>xs.map(f)) xss.map(xs->f(xs.flatten)) Consider the following Java code. static void () { int x - 2 int y = 5: System.out.println ((***) . ty++)) System.out.println (*); System.out.println (y); > Which three numbers will be printed when method f is called? 10,2,5 15,3,6 10,3,6 12,3,6 18,3,6 Consider the following program to count to 1000. IDENTIFICATION DIVISION. PROGRAM-ID. ADD. ENVIRONMENT DIVISION. DATA DIVISION. WORKING-STORAGE SECTION. 77 IDX PICTURE 9999. 77 SUMX PICTURE 999999. 77 X PICTURE X. PROCEDURE DIVISION. BEGIN. ACCEPT X. MOVE ZERO TO IDX. MOVE ZERO TO SUMX. PERFORM ADD-PAR UNTIL IDX = 1001. DISPLAY SUMX. STOP RUN. ADD-PAR. COMPUTE SUMX = SUMX + IDX. ADD 1 TO IDX. Which programming language is this written in? COBOL JavaScript Pascal Lisp Scala