Which algorithm is used to find the shortest path in a graph?A$)$ Depth$-$First SearchB$)$ Breadth$-$First SearchC$)$ Dijkstra's AlgorithmD$)$ Kruskal's Algorithm