Consider the relation schema lineup $=$ fTeam, Opponent, Day, Player, Number, Positiong, with the following set $$of FDs:$(1)$ fTeam, Dayg $!$ Opponent, and$(2)$ fOpponent, Dayg $!$ Team$($each team plays at most one game in a day$).(3)$ fTeam, Playerg $!$ Number$($a player has one number in the team they're on$).(4)$ fTeam, Day, Numberg $!$ Player$($two players on the same team cannot have the same number at the same time$).(5)$ fDay, Team, Opponent, Playerg $!$ Position$($each player that is part of the lineup for a game is assigned one position in that game$).2\mathrm{.}1$ What are the candidate keys of lineup? Justify your answer $($i$.$e$.,$ include the main steps used for $$nding the$$candidate keys$).(1$ Mark$)2\mathrm{.}2$ Find a minimal cover of $.$ Justify your answer $($i$.$e$.,$ include the main steps used for $$nding a minimal cover$).(2$ Mark$)2\mathrm{.}3$ Demonstrate whether lineup, given $,$ satis$$es $3$NF$,$ and if not, identify a $3$NF decomposition for lineup. You$$need to include the main steps used for identifying the $3$NF decomposition. $(1$ Mark$)$