Let B1, B2, B3, B4, B5 be five matrices of dimensions 15 x 20, 20 x 17, 17 x 22, 22 x 16, 16 x 23 respectively. The minimum number of scalar multiplications required to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method _____

Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm? $O (E \hspace{0.1cm}log\hspace{0.1cm} V)$ $O (V^2 \hspace{0.1cm}log\hspace{0.1cm} V)$ $O(V^2)$ $O(VE)$