The spinner is divided into 3 equal parts. Use a tree diagram to find the number of possible outcomes when the pointer on the spinner is spun twice.

9 outcomes
1) Given that this is a three-parted spinner we can draw the following tree diagram:
2) So, looking at the tree diagram we can write down the following outcomes:
[tex]NN,NE,NU,EN,EE,EU,UN,UE,UU[/tex]Based on that we can tell that there is a total number of 9 outcomes.