7. Assume that we have an algorithm that prints "Hello World" the following number of times. Demonstrate how to find the solution to the runtime of this algorithm (hint: use an arithmetic series in the solution). 1+2+3+4+...+n 8. Write the pseudocode for a linear search algorithm and state the asymptotic complexity of this algorithm. 9. Write the pseudocode for the binary search algorithm and state the asymptotic complexity of this algorithm.