Question: A greedy algorithm is any algorithm that follows the problem$-$solving heuristic of making the locally optimal choice at each stage. You are required to identify any TWO $(2)$ real applications that simulate and apply Greedy Algorithms. Each application chosen must represent either Dikstra, Kruskal or Prim algorithms. Every application should have the following information: i$.$ Name of the application ii$.$ Type of greedy algoritm used iii. Sinopsis $/$ overview of the appication $/$ system iv$.$ Graph representation $/$ Input handling $/$ Expected outcome v$.$ Your own comment about the application please write $7$ pages