This is for java class.

Complexity Class of Algorithms 1. Write in the space provided below an algorithm for a braces/brackets the time complexity for each complexity next to each bracket). Indicate in some way the most line ofcodt to ech bracket). Indicate in some way the most frequently executed statement (making sure to write the code i.e. the code that dominates your algorithm. From your list of complexities your is determine the complexity class, Ofy for the linear search algotm Consider the algorithm for finding the maximum number in an array of n elements Write out below a possible algorithm for finding the maximum number. Highlight with braces/brackets the time complexity for each statement (making sure to write the complexity next to each bracket). Indicate in some way the most frequently executed line of code i.e. the code that dominates your algorithm. From your list of complexities determine the complexity class, 0fx) for finding the maximum number in an array