CS 367 Spring 2004, Midterm 3P2004 Karen Miller and Deb Deppelerpage: 9 - 3PPart III Written Answers[3 questions, 19 total points]Write your answers to the remaining questions in this examination booklet. If you need more room indi-cate where your work continues.27.)[6 points]Fill in the following table with tightest O( ) for the method's execution time for thespecified ADT. Give your answer in terms of n, where n is the number of items.28.)[6 points]The Wing and a Prayer Airline Company cannot keep up with quote requests for ticketprices, because the algorithm their computer program uses to determine fares is O(n3). They flyto thousands of cities, and a weighted graph of their routes gives fare prices for each leg of aflight. They have offered free airline tickets to anyone who can help them. How do you get thosefree tickets? Justify it in terms of O( ) efficiency.Complete for ADT:Binary Search TreeOperationarraylinked nodelook upaddremove