SHORT ANSWER
1. Describe best case, average case, and worst case in terms of Big O Notation. When implementing algorithms or data structures which two "Big O cases" are most important to consider and why?
2. Compare and Contrast Sequential Access to Random Access and give examples of algorithms or data structures that align with both concepts?