Given a directed weighted graph GV$,$ E where there are N vertices and M edges in graph G$.$The graph is represented by an adjacent matrix. Which one$($s$)$ of the following statements is$/$are correct?A greedy algorithm can find an optimal path of a single source to a single destination.It takes the time complexity of O$($N$\backslash$deg $)$ to find optimal paths of all sources to all destinations.A greedy algorithm can find optimal paths of a single source to all destinations.A solution for a single source to all destinations must be a tree structure.