$(30$ pts$)$ Consider the network fragment shown below. x has only two$$attached neighbors, w and y$.$ w has a minimum$-$cost path to destination$$u $($illustrated with the dotted line through the remaining network$)$ of $9,$and y has a minimum$-$cost path to u of $11.$ The complete paths from w$$and y to u $($and between w and y$)$ are pictured with dotted lines, as they$$are irrelevant to the solution.