a 1. Create a stack called numbers, which contains all numbers from 1 to 4 2. Initialise a variable k to be 1 3. For the element k in a column, store the number in that element to a variable called value and call SEARCH- STACK(numbers, value) 4. If the function returns FALSE, then we should return FALSE as a number appears twice or not at all in the stack 5. If the function returns the stack, increase the value of k by one and go to step 3 6. If after checking all elements in the column, SEARCHSTACK has not returned FALSE, we return TRUE In the next task you will need to complete a function that carries out this algorithm for column ; of the input puzzle. Task 5: Complete the following function: function CHECKCOLUMN(puzzle, j) end function This function will take the vector puzzle (as produced by MAKEVECTOR) as an input parameter and check that column 3 contains all numbers from 1 to 4: if it does contain all numbers from 1 to 4, it should return TRUE, otherwise it should return FALSE. The procedure you should use is the one outlined above. To get full marks you need to call SEARCHSTACK(stack, item)