Select an incorrect statement for the given Tree structure. 50 2 30 14 60 15 25 6 16 70 100 17 99 27 O a. 70, 100 are terminal nodes O b. 17, 99, 27 are siblings O c. 2, 30, 14, 60 are siblings O d. 7,16 are siblings Which one of the following requires swapping technique to get an ordered list? a. Insertion sort O b. Merge sort O c. None of these O d. Bubble sort The depth of node 13 in the given tree below is 8 10 12 14 O a. 4 O b. None of these O c. 13 O d. 5 A queue data-structure can be used for a. Recursion O b. Resource Allocation O c. Expression Evaluation O d. All of the above is a pile in which items are added at one end and removed from the other. a. Array O b. Queue O c. Stack O d. List