Problem
1) The man: function returns the maximum numerical value in a list of integers. For example, max(4,5,8) = 8. Describe the algorithm for computing the max function using pseudo code, or actual program code (which programming language does not matter). How many comparisons are required by the algorithm in terms of n, the number of items in the list?
2) How many edges are there for a complete undirected graph with 8 nodes? How many edges are there for a complete directed graph?