What is the lower bound time complexity of the problem "Finding the largest number of n numbers" Support your answer by providing valid mathematical reasoning. Can you provide a divide and conquer algorithm that achieves the lower bound? If so, write the pseudo-code of the algorithm and derive the time complexity of your algorithm in terms of big-oh notation.

This is a Data Structure and Algorithm Problem