Write a recursive function squares that receives a positive integer n and prints out the first n perfect squares in descending order. (A perfect square is a number that is the product of an integer with itself; they start with 1 (1*1), 4(2*2), 9 (3*3)...)
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).