Perform the following sequence of operations in an initially empty splay tree and draw the tree after each set of operations. a. Insert keys 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, in this order. b. Search for keys 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, in this order. c. Delete keys 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, in this order.

Write a method so that the main() code below can be replaced by the simpler code that calls method original main(): public class calcmiles { public static void main(string [] args) { double milesperhour; double minutestraveled; double hourstraveled; double milestraveled; milesprhour = scnr.nextdouble(); minutestraveled = scnr.nextdouble(); hourstraveled = minutestraveled / 60.0; milestraveled = hourstraveled * milesperhour; system.out.println("miles: " + milestraveled); } }