I asked for help with this question earlier, but the code given didn't work when I tried it, so I am asking again. In scheme in DrRacket please!

In this assignment, you will be learning Scheme through the use of DrRacket. We start with some basic concepts; trying to understand prefix notation and using procedures in Scheme. You may only use the procedures shown in the text and slides also see below for three prohibited forms in this assignment - not any of the additional library procedures in R5RS Scheme. Solve the following questions in the .rkt template provided.

3. Define a recursive procedure called "square" that will compute the square amount of a value by calling the "add" procedure defined in the previous question. You may not use the multiplication operator. 3.1 You must use the add procedure defined above. 3.2 You will need to account for negative values as well. 3.3 Use comments to indicate which code represents the four steps of the fantastic abstract approach, respectively: ; The code for size-n problem is: ; The code for stopping condition and its return value are: ; The code for size-m problem is: ; The code for constructing size-n problem is: Hint: This will require a conditional and possibly the (absx) procedure. Note, you can use this formula to identify your size- (n1) problem: n2=1+3+5++(n+n1). >(square5)25>(square-7)49 If you need to create a helper procedure, please name it square-helper