Trees · Medium problem

Two proposed degree sequences for a tree on $8$ vertices are (A) $4,3,2,1,1,1,1,1$ and (B) $5,3,2,1,1,1,1,0$. Exactly one of them could actually be a tree's degree sequence. For that valid one, what is its largest degree?