Given the following Branch$-$and$-$Bound tree, where nodes are labeled $N_1,$dots, $N_g$ and the numbers below each node indicate the value of its LP relaxation. The incumbent solution was obtained in solving the LP at $N_4.$ The optimal LP solution was feasible for the IP and had objective value $25.$

Let $v_9$ be the optimum value of the LP associated with node $N_9.$ Choose the best answer.

$v_9=26\mathrm{.}5$

$v_{9}25\mathrm{.}2$

$v_{9}27\mathrm{.}2$

$v_{9}26\mathrm{.}5$