Find a trivial lower-bound class for each of the following problems and indicate, if you can, whether this bound is tight.
a. finding the largest element in an array
b. checking completeness of a graph represented by its adjacency matrix
c. generating all the subsets of an n-element set
d. determining whether n given real numbers are all distinct

“ a line segment that has the endpoints on the circle and passes through the midpoint is called the diameter. the diameter is twice the size of the radius. a line segment that has its endpoints on the circular border but does not pass through the midpoint is called a chord. a circle is the same as 360 small circle up the number 0 . i hope this .

i dont know what you want me to answer for this but im guessing 2: 11?