A) Internally, a bin heap is typically implemented as a BST that has the additional ordering property that the minimum value is at the root (or the maximum value is at the root, if we chose to make the bin heap to be a max heap).TrueFalseB) In DIJKSTRA (match the phrases):1. might end up taking more time because inserting into this data structure is not a constant-time operation.2. might end up taking more time due to multiple copies of the same vertex being pushed and popped unnecessarily. a) using a quenue for partially processed verticesb) using a set for partially processed verticesYou are given an array of N elements in sorted order. You can create a balanced Binary Search Tree from this array in(Pick only the tightest bound)O(N) timeO(N log N) timeO(N^2) timeO(1) time