Suppose after running the Dijkstra's algorithm on a $6$ node example, the following labels and predecessors $($in the brackets$)$ are defined for each node. What is the minimum cost of going from node $1$ to node $6.$

$$

$1$

$2$

$3$

$4$

$5$

$6$

$0[0]$

$1[1]$

$10[5]$

$8[2]$

$3[1]$

$14[1]$

$6[2]$

$$

$7[4]$

$5[2]$

$$

$10[5]$

$8[3]$

Group of answer choices

The optimal shipment size will be equal to $107$ units

The optimal shipment size will be more than $107$ units

The optimal shipment size will be less than $107$ units