Given the following tree, indicate which order$($s$)$ data may have been entered that would have resulted in this exact tree if using the less than or equal goes left and strictly greater foes right for adding to the tree recursively.

Question

$\_74615171053111216$

$\_74151761016312115$

$\_76543101112151617$

$\_71543106171216113$

$\_74153610175121611$

Match

A$.$ Does not produce this exact binary tree

B$.$ Does not produce a binary tree

C$.$ Will produce this exact binary tree

D$.$ Produces a binary tree

Refer to the pseudocode for Delimiter Check FSM for this question.

Given the following input string, you are to provide the sequence of states that will be traversed separated by a single space. Provide numeric state followed by single space only with no additional text including excess spacing, commas, etc. For example: Input of $(2)$ would result in the following response: $01040203$

Be sure to start with state $0,$ follow FSM carefully and keep track of where you are input string as well as the current status of the stack and other temporary variables and strings that may be used.

Answer is either right or wrong and will not receive partial credit. Any answer that does not use the required format stated above will be counted wrong.

Input: $[()$

Given the input $[])$ what which of the following best describes the resulting output

Refer to the pseudocode for RPN Evaluator FSM for this question.

Given the following input string, you are to provide the sequence of states that will be traversed separated by a single space. Provide numeric state followed by single space only with no additional text including excess spacing, commas, etc.

For example: Input of $23+$ would result in the following response: $02304023040105$

Be sure to start with state $0,$ follow FSM carefully and keep track of where you are input string as well as the current status of the stack and other temporary variables and strings that may be used.

Answer is either right or wrong and will not receive partial credit. Any answer that does not use the required format stated above will be counted wrong.

Input: $6\mathrm{.}75*$

Refer to the pseudocode for FSM to implement reduced version of Dijkstra's Shunting Yard Algorithm for conversion of Algebraic expressions to RPN for this question.

Given the following input string, you are to provide the sequence of states that will be traversed separated by a single space. Provide numeric state followed by single space only with no additional text including excess spacing, commas, etc.

For example: Input of $2+3$ would result in the following response: $01020105$

Be sure to start with state $0,$ follow FSM carefully and keep track of where you are input string as well as the current status of the stack and other temporary variables and strings that may be used.

Answer is either right or wrong and will not receive partial credit. Any answer that does not use the required format stated above will be counted wrong.

Input: $(1\mathrm{.}5+2\mathrm{.}5)/2$

Given the input $(2+3)*(4+5)$ in previous question, what $($if anything$)$ is on the stack upon arrival to state $5$ at end of input string?

Provide answer as a series of character$($s$)$ separated by single space: For example if there are $3$ items on stack then the items will be listed separated by single space only