<p><img alt="8. (10 pts.) To find the top student (i.e. the one with the highest GPA) at a university requires O(n) time (use the algorithm that finds the maximum). Suppose
<p><img alt="5. A system which consists of N distinguishable particles has 3 energy levels, ε 1-E ε 2-2E and ε 3-3E with gle 1) = g(ε 3)-1 and g(ε 2-2.