Given the following ternary tree, which of the following are valid orderings of nodes accessed using the depth first search algorithm? (Select all that apply) Hint: In this ternary tree, there are no inherent left or right directions for the search algorithm. Use the properties of the depth first search algorithm to determine which are valid permutations of the search. Accessed means when any of a node's properties are used (value, left node, or right node) in the depth first search. Hint: In this ternary tree, there are no inherent left or right directions for the search algorithm. Use the properties of the depth first search algorithm to determine which are valid permutations of the search. Accessed means when any of a node's properties are used (value, left node, or right node) in the depth first search. 148376259 143287659 134267579 125936748 123456789 148259376 136724598