Given T, the following binary tree 19 12 43 9 15 21 67 3 13 18 34 70 . and two tree walk algorithms, that both print the node keys along the way: ITErWALK(T) I Let S be a stack RecWAlK(x) 3 PUSH(S,x) 4 while S is not empty if x == NIL return 2 3 PRINT(.key) ifx.rightNIL if x. left NIL 4 6 7 PUSH(S,x. left) x.left REcWALK(x.right) else.f x.right-= NIL 6 ifx.left NIL REcWALK(x.left) 9 10 listed POP(S) PRINT(listed. key) if listed.rightNIL RecWALKWRAPPER(T) 1 RecWALK(T.root) PusH(S, listed. right) 12 13 14 listed. right else x. right Assign each algorithm its unique, correct expected output on the console, among those listed below: 119,12,9,3, 13, 15, 18,43,21,67,34,70 2 3,13,9,18,15,12,21,34,70,67,43, 19 3 3,9, 13, 12, 15, 18, 19,21,43,34,67,70 419,12,43, 9, 15,21,67,3, 13, 18,34,70 19, 43, 67, 70, 34, 21 , 12, 15, 18, 9, 13, 3 19, 43, 12, 67, 21, 15, 9, 70, 34, 18, 13, 3 ITERWALK RecWALKWRAPPER