$3.$ Consider the following sequential game

$1$

L

R

$2$

$2$

L$\text{'}$

R$\text{'}$

L

R$\text{'}$

Payoff to Player $1$:

Payoff to Player $2$:

$3$

$1$

$1$

$2$

$2$

$1$

$0$

$0$

a$.$ Write the above game in the "normal form"

b$.$ Find all of the Nash Equilibria in pure strategies from the normal form of the game

c$.$ Find the Subgame Perfect Equilibrium of the Game