Eventual exact rainbow saturation conjecture for $C_5$

Let $C_5$ denote the cycle on five vertices, and let $rsat(n,C_5)$ be its rainbow saturation number. Eventual exact rainbow saturation conjecture for $C_5$. There exists $N_0\in\mathbb{N}$ such that, for every $n\geq N_0$,

$$rsat(n,C_5)=2n-6.$$

This asserts that the paper's construction for $C_5$ is eventually optimal, making its upper bound the exact value for all sufficiently large orders. The statement is presented as a belief following the paper's bounds; no resolution is supplied.