Q$.$ Determine exactly which of the following applies best $($no explanation needed if checiced True or False$)$:

a$.$ Quidsort works faster than merge sort for lange input size $(n>1000).$

b$.$ Quidsort's worst case asymptotic rumtime complexity forma a tight upper bound on merge sort's

asymptatic runtime complexity.

c$.$ duiclosort's worst case esymptotic runtime complexity forms a non$-$tight upper bound on merge sort's

aymptetic runtime complexity.

Quidsart's worst case asymptotic runtime complesity forms a lower bound on merge sort's worst

case asymptotic runtime complexity.

Quicisort's average asymptotic runtime complecity forms a lower bound on merge sort's asymptotic

runtime complexity.