1 Tree traversal Given T, the following binary tree and two tree walk algorithma, that both prat tbr todr lays the way TERWALKT 1 Let S be a stack PusSx) while 5 is not empty listed POP(5) PuxT listed.key) if listed. ryht 10 PusH S, listed night x listed. right 12 else xx.nght Assign each algorithm its snique, conmect expected output on the console, among those listed below 19,12,9,13,15,18,43,21,67,34,70 13,9, 18, 15, 12,21,34, 70,67,43, 19 33.913,12,15,1,19,21,43,34,67,70 4 19 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 127.21,15,9,70,34, 18,13,3 ITERWALK 2 Binary Search Tree property la the tree represented in exercise (1) a BSTY Explain 3 In construction We inaert keys in an empty BST, in the order listed below 10,4,5, 12,1,634,50,203 Assumisg we use the insertion algaet m Th18-1NSIR7 apaedCLAS, 123, dzaw the tea alting tree