The upper bound always specifies the worse case performance of an algorithm within the constraints of the constants, which are usually represented by:
a. c and n
b. x and y
c. a and b
d. m and k