2 problems

Rainbow disconnection bound. The conjecture states

Chartrand et al.'s conjecture. The maximum size of a connected graph $G$ of order $n$ with $rd(G)=k$ is