All$-$Pairs Shortest Paths: Floyd$-$Warshall Problem:$$Given the following weighted graph with the adjacency matrix:$```$

A B C D

A $[0,3,\backslash$infty $,\backslash$infty $]$

B $[\backslash$infty $,0,1,\backslash$infty $]$

C $[\backslash$infty $,\backslash$infty $,0,2]$

D $[1,\backslash$infty $,\backslash$infty $,0]```$

Find the shortest paths between all pairs of vertices using the Floyd$-$Warshall$$algorithm$.---$

Bonus Question $(5$ marks$)$Problem:$$Explain the difference between dynamic programming and greedy$$algorithms$.$ Provide examples where each approach is more suitable.