I would like to know if the overall running time of my algorithm is O$($n$^2).$ What process do I need to follow to determine whether this is true or not $($even if those statements do not represent a tight bound$)?$

Question $6$ options:

a$)$

Analyze the structure of the algorithm in the worst$-$case. If that is greater than or equal to n$2,$ then you can state the worst$-$case running time of the algorithm is O$($n$2).$

b$)$

Find an example data set that runs in c$*$n$2$ time.

c$)$

Analyze the structure of the algorithm to find the worst$-$case running time. If the worst$-$case running time is less than or equal to $|$c$*$n$2|,$ then you can state the overall running time of the algorithm will be no worse than O$($n$2).$

d$)$

Run the algorithm on a sample data set. If the running time is greater than c$*$n$2,$ then you can state the overall running time of the algorithm is O$($n$2).$