A decision tree begins at decision node $1$ and an upper and lower branch extend from this node to the right. The upper branch, labeled d$1,$ stops at chance node $2$ and an upper, middle and lower branch extend from this node to the right. The lower branch, labeled d$2,$ stops at chance node $3$ and an upper, middle and lower branch extend from this node to the right.

The branches extending from decision node $1$ from top to bottom are labeled d$1$ and d$2.$ The next set of branches from top to bottom are labeled s$1,$ s$2,$ s$3,$ s$1,$ s$2$ and s$3.$ The values to the right of these branches are $270,120,45,120,120,$ and $95$ respectively.

Using the optimistic approach, the largest maximum profit is by decision $.$

Using the conservative approach, the largest minimum profit is by decision $.$

Using the minimax regret approach, decision minimizes the maximum regret with a value of $.$