int minCost$($int src$,$ int dest, int$[][]$ W$,$ int$[][]$ P$)$

This method takes as parameters the index of the source vertex src$,$ the index of the

destination vertex dest, as well as an adjacent matrix W and a shortest path matrix P$,$ where W

is the input to the Floyd$$s shortest path algorithm, which produces P$.$ The method uses a divide$-$

and$-$conquer algorithm to find the length of the shortest path from vertices src to dest. Note

that you should assume that the index of both matrices starts at $1.$ You should NOT change

the content of the array parameters.