after Describe a $($simple$)$ modification to the Dijkstra algorithm so as to make it return the

path$($s$)$ containing the smallest number of links.After realizing his mistake, the same friend now proposes you to take the negative of

each link cost $($e$.$g$.2$ instead of $2)$ to find the longest paths instead of the shortest

ones. Explain with an example why this would not work.