Prim's Algorithms for minimum spanning trees in pseudo$-$code is given as:

Capture$5.$PNG

Its runtime is O$($E log V$)$ assuming the Q is implemented as $...$

Group of answer choices

vector data structure

heap or priority queue data structure

pointer$-$based linked list data structure

binary search tree data structure