Part A: Word definitions [20 marks] Match up the term on the left with the phrase on the right that best describes the term.An example answer has been provided for you. A quicksort B compareTo C linked list D search key E base case F LIFO G circular linked list H exception I interface an unusual event that occurs daring the execution of a program a notation that specifies an algorithm's order, usually involving terms k and no the part of a record that identifies it within a collection of records an algorithm that requires the collectin of data to fit entirely in the computer's main memory the usual method invoked in Java when determining the sort order of two objects a set of zero or more nodes, partitioned into a root node and two possibly empty sets, that are also the same kind of thing as this in Java, a program component that only declares methods required of a class natural-language or mathematical description of the behavior needed from a set of operations a known case for a problem's solution in which the answer is known immediately (and can be returned without any further recursive calls a design technique for hiding the inner details of some datatype's lementation K binary tree L foreach loop M growth-rate function N coconut milk a property of a list where the removal/retrieval operations access the most recently inserted item a class without instances that forms the basis of other classes that descend (i.e,are subclassed) from it a process that solves a problem by solving smaller problems of exactly the same type as the original a collection of data values together with a set of well-specified operations on that data a collection of elements (or nodes) that are connected, one to another, such that each element references the next in the collection O big O notation P encapsulation Q internal sort R abstract data type S spectfication TFPO U abstract class a property of a list where the removal/retrieval operations access the item that was inserted earliest a mathematical construct used to specify an algorithm's order (in time or in space) in terms of the size of the problem an algorithm that partitions an array's elements around a pivot to generate two smaller problems a miracle cure proposed by Dr. Oz for darn near everything, including occluded-while-loop syndrome an iteration construct especially useful when iterating through all ofthe elements in a collection a collection of nodes whose last node references the first node Page 2 of 19