Data Algorithims and Structures Question in C++. Plz provide work or explanation to help understand, thank you.

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. 148376259 123456789 136724598 125936748 148259376 134267579 143287659