The best running time is defined as/obtained as/by:
1
the least or smallest of all the running times the algorithm takes, on inputs of a particular size.
2
an input that requires maximum computations or resources.
3
averaging the different running times for all inputs of a particular kind.
4
none of the options.