I need help solving this basic Insertion Sort algorithmic problem

The question is as follows

Somebody asked the same question already on Chegg but it wasn't correct.

Thank you for your time

Which statements below are correct? (Multiple correct answers.) Reminder: O is like = omega is like >; Theta is like ==. Note: This question is referring to CORRECT statement, which may not be the BEST statement you would use to describe the running time of insertion sort. 1. The worst-case running time of Insertion Sort is O(n^2). 2. The worst-case running time of Insertion Sort is Theta(n^2). 3. The worst-case running time of Insertion sort is Omega(n^2). 4. The worst-case running time of Insertion sort is o(n^2). 5. The best-case running time of Insertion sort is O(n^2). 6. The best-case running time of Insertion sort is Omega(n^2). 7. The best-case running time of Insertion sort is Theta(n). 8. The best-case running time of Insertion sort is Omega(n). 9. The running time of Insertion Sort is O(n^2). 10. The average-case running time of Insertion sort is Theta(n^2)