You will find the minimum element from the lists of integers.

You will find the minimum element from the lists of integers.
Input: [[5,2,31,9],[2,1,6,7,11],[55,1,7,8,9]]
Output: 1. [The minimum among the lists of integers]
1. Implement a program of O(N^k) runtime complexity of the problem.
2. Implement a program of ~ O(N*logN) runtime complexity of the above same problem. [Hint : Apply the log rule]
3. Test and compare the results of 1 and 2 with a large size input (e.g., Input size >= 50X50)
Your screenshots are must be in pages.
Note: All code must be in java and I need to run it to run in Eclipse before submitting. I need to run the codes on my own computer too.