Please show steps on how you achieved your answer. Thank you in advanced and appreciate your time!

STUDY PROBLEM 10 In what situations B-Tree is better than Binary Search Tree? Describe why. STUDY PROBLEM 11 Draw subsequent B-trees trees after inserting 6, 19, 17, 1,3, 12, 8, 20, 22, 13, 18, 14, 16, 1, 2, 24, 25, 4, 26 5 into an initially empty B-tree, using the procedure with preemptive node splits. The minimum B-tree degree is t-2. STUDY PROBLEM 12 For a given set of line segments, show where the sweeping lines (the vertical lines) should be, what is inserted and removed from the Binary Search Tree at each line, and which segments are compared at that sweeping line STUDY PROBLEM 13 Describe the approach used to analyze the complexity of the Graham's scan method for finding the convex hull of a set of points, in particular how to quantify the average number of iterations of the while loop in one iteration of the for loop. STUDY PROBLEM 10 In what situations B-Tree is better than Binary Search Tree? Describe why. STUDY PROBLEM 11 Draw subsequent B-trees trees after inserting 6, 19, 17, 1,3, 12, 8, 20, 22, 13, 18, 14, 16, 1, 2, 24, 25, 4, 26 5 into an initially empty B-tree, using the procedure with preemptive node splits. The minimum B-tree degree is t-2. STUDY PROBLEM 12 For a given set of line segments, show where the sweeping lines (the vertical lines) should be, what is inserted and removed from the Binary Search Tree at each line, and which segments are compared at that sweeping line STUDY PROBLEM 13 Describe the approach used to analyze the complexity of the Graham's scan method for finding the convex hull of a set of points, in particular how to quantify the average number of iterations of the while loop in one iteration of the for loop