Which sorting algorithm has the worst$-$case time complexity of O$($n$^2)?$

a$)$ Merge Sort

b$)$ Quick Sort

c$)$ Bubble Sort

d$)$ Insertion Sort