ASAP please match all the terms

Match each term to its description or definition. Due to formatting limitations in Canvas, assume: "n"2" means "n squared "log2(n)" means "log base 2 of " . . Algorithm Ollog2) [Choose] In theory (but not in practice), the big-O of quicksort An "almost-fullbinary tree; the rightmost nodes of the bottom row may be missing The Greek letter, used for expressing both upper and lower bounds of complexity. In Quicksort, the value used for partitioning the array the Big- of binary search A step-by-step procedure for solving a problem A binary tree in which each leaf node has the same depth (like a Christmas tree) A complete binary tree where the "largest" node is always at the root A measurement of the number of steps an algorithm will require. The Greek letter o used for expressing "lower bounds" complexity theta Oin2) max-heap Choose complexity Choose pivot | Choose Choose omega Choose Complete binary tree [ Choose Full binary tree Choose