Given the tree below. Give the order that nodes would be visited in during an in-order traversal of the tree from the root.

Given the tree below. Give the order that nodes would be visited in during an in-order traversal of the tree from the root. Notes: - You can assume each node contains a unique integer value. - You answer should be a sequence of node letters (with no space or commas between them), eg, xyzabc - All characters in this question are lower case. Answer: (penalty regime: 60,100,% )