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 permutations of the orders in which the nodes were accessed using the breadth first search algorithm? (Select all that apply) Hint: In this ternary tree, there is no inherent left or right direction for the search algorithm. Use the properties of the breadth first search algorithm to determine which are valid permutations. Accessed means when any of a node's properties are used (value, left node, or right node) in the breadth first search. 148259376 125936748 123456789 136724598 134267859 143287659 148376259