Recall the pseudocode from lectures for identifying a good VLSI chip. The idea can be reused to finding the majority item in a list, where the majority is defined by the element in a list of size n which occurs at least n/2 + 1 times. Write a linear-time program to find the majority element in an array. What is the invariant of your loop? What is the variant of your loop? Explain why your design has linear time performance. Write JUnit tests to check your program.