use step count method to find the time complexity of Dijkstras Algorithm?

Graph Greedy Algorithm Dijkstra's Algorithm 1. Initialize stal] with the start vertex, s, and rem[] with the remaining vertices, r in which (v-s=r) 2. for all rin rem[] 3 Set path pat[r] to s 4. if there is an edge (s, r) 5. Set distance dis[r] to weight(s,r) else 6. Set distance dis[r] to 7. while rem[] is not empty 8. for all unvisited u in rem[], find the smallest dis[u] 9. Remove u from rem[] and add it to stal] 10. for all r adjacent to u in reml] 11. if dis[u] + weight(u, r) is