a) Write an algorithm that prints all the subsets of three elements of a set of n elements (integers). The input to the algorithm is an array of integers (the elements of the set). The output is a list of all the subsets of three element. (please in simple pseudo code as in book Foundations of Algorithms chapter 1)

Identify a basic operation for your algorithm and study the performance of your algorithm by giving its time complexity function. If it has an every-case time complexity, determine it. Otherwise, determine the worst-case time complexity.

Identify the complexity category to which the algorithm belongs.

Implement your algorithm using Java. Write a main method that asks the user to enter the size and elements of a set of integers, stores them in an array and then prints all the subsets of three-elements.