$4.(20$ points$)$ Given a relation R$=\{$P$,$ Q$,$ R$,$ S$,$ T$\}$ with the following functional dependencies: PQ$->$R RS $->$ T ST$->$Q Decompose R into $3$ NF relations. Show your work to receive full credit.Consider a relation $R(P,Q,R,S,T)$ with the set of

functional dependencies $,$ and

$TP\}.$ How many super keys are possible in $R?$