Question 41 Plast while inserting the elements in Empty Binary Search Tree, which element will be in the lowest Elements: 72, 64,85, 70, 68, 84 0 21 28 O 66 35 84 42 68 070 49 Clear my choice Question 42 Answer saved Marked out of 1 P Flag question Using Bubble Sort, sort the numbers in Ascending order Numbers:8, 22, 7, 9, 31, 5, 13 O 13 011 12 O 10 Clear my choice Answer saved Marked out of 1 Question 43 p Flag question Question 46 Not yet anwwered Marked out of The left Flag question Consider the max heap with the elements : 41, 31.21.11.1617. 18.9.5. After inserting the new element 36 into beap, select how we will O 41,31, 21, 11, 16, 17, 18, 9, 5,36 41,36, 21, 11, 16, 17, 18,9 5,31 O 41,31, 21, 11, 36, 17, 18, 9.5.16 41, 36, 21, 11, 31, 17, 18,9,5, 16 Question 47 Answer saved Marked out of 1 Flag question Consider a tree in which all the nodes are having a degree 2. Whether that tree is considered as a complete binary tree? Select ones True O False Question 48 Not yet answered Maried out of 1 p Flag question Heap Sort is slower than Shell Sort Select one: True False