Choose the incorrect statement regarding Dijkstra$$s algorithm

Dijstra$$s algorithm requires to dynamically update distance$/$costs$/$weights of paths

To begin with, Dijstra$$s algorithm initializes all distance as INF

Dijstra$$s algorithm can be implemented by heaps, leading to O$(|$E$|+|$V$|$ log$(|$V$|))$ time complexity, where, particularly, log$(|$V$|)$ is due to $$insert$$ operation in heaps

Dijstra$$s algorithm is a greedy algorithm