Consider the following maximum heap: 20 10 18 5 8 9 4. After inserting node 15, the heap elements will rearrange to 20 15 18 10 8 945 15 18 20 4 9 8 10 5 15 20 18 10 8 945 20 10 18 15 8 945 Select all True statements (Negative points for incorrect selection) The time complexity of Dijkstra's algorithm is O(IV+ E) log V) if binary heap is used. The Dijkstra's algorithm find the minimum spanning tree in a graph In Dijkstra's algorithm the node with minimum distance from the source is selected from the remaining nodes in the unvisited and the distance of its adjacent nodes are updated. Dijkstra's Algorithm produces correct results if graph has negative edge weight. Select all true statement (Negative points for incorrect selection) Every node has the property that its value is less than or equal to its left child value and greater than or equal to its right child value. The height of a Binary Search tree is O(log N) The remove operation considers three different cases A Binary Search Tree is a complete tree