algorithms – my dsa teacher gave a assignment which is really confusing (i asked my teacher about it but she said just google it and find it out yourself)

Write best case, worst case and average case time complexity of following categories of
algorithm–

a. Constant time

b. Linear time

c. Logarithmic time

d. Polynomial time

e. Exponential time

(this question which is where I am mostly confused as like if she had asked best case, worst case and average case of like a linear search thats easy but what this question is trying to ask is the question for me and yes i did as my teacher as said in the title)

(sorry my knowledge in dsa is quite low rn as i keep on getting 5 to 6 assignments per week and have very little time for self study)