(i) By considering the comple te graph with n vertices, show that the maximum number of simple paths between two vertices is O (( n ? 1)!).

(ii) Give an example where Dijkstras algorithm gives the wrong answer in the presenceof a negative edge but no negative cost cycles.