Develop a linear-time (i., O(m)-time) algorithm that solves the Single-Source Shortest Path problem for graphs whose edge weights are positive...

3. Develop a linear-time (i.e., O(m)-time) algorithm that solves the Single-Source Shortest Path problem for graphs whose edge weights are positive integers bounded by 10. (Hint. You can either modify Dijstra's algorithm or consider using Breath-First-Search.)