Find a trivial lower-bound class for each of the following problems and indicate, if you can, whether this bound is tight.

Afinding the largest element in an array

Bchecking completeness of a graph represented by its adjacency matrix

Cgenerating all the subsets of an n-element set

Ddetermining whether n given real numbers are all distinct