Envision an algorithm that when given any positive integer n, it will print out the sum of the squares from 1 to n.

E.g. given 4 the algorithm would print 30 (because 1 + 4 + 9 + 16 = 30) You can use multiplication denoted as * in your solution and you do not have to define it (e.g. 2*2=4)

Write pseudocode for this algorithm using iteration (looping).