The time complexity of Dijkstra$$s algorithm $($N nodes and E edges$)$ that uses a priority queue is

a$.$

O$($ELogN$)$

b$.$

O$(($E$+$N$)$ Log N$).$

c$.$

O$($NLog$($E$+$N$))$

d$.$

O$($E$+$N$)$