Say you have written a program inside which, first, you have implemented a O$($n$^2)$

time algorithm, and then a O$($logn$)$

time algorithm, and finally another O$($n$^2)$

time algorithm in the end; all three algorithms in a sequence $($one after the other$).$ What is the overall time complexity of your program?