$(1$ point$)$ Consider the atomic routing game shown in the following figure, where we want to

route three units of traffic from $s$ to $t.$ There are two edges, the top edge with cost function

$g_1(x)=x^2$ and the bottom edge with cost function $g_2(x)=x+2.$

Determine all $($pure$)$ equilibrium flows of this game.