Tarjan's algorithm was performed on some graph in order to find the SCCs.
During its work, the stack that contains the visited nodes was filled with these values: 1->4->2->9->6->10 (node '1' is at the bottom and node '10' is at the top).
Considering that the node '9' is the root of the SCC, find the rest of the members of this component.