One of your friend proposes you to modify the Dijkstra algorithm to find the longest

paths instead of the shortest ones by considering the inverse of each link cost $($e$.$g$.1$

$2$

instead of $2).$ Explain with an example why this would not work.