SOLVE THE FOLLOWING IN HASKELL WITHOUT USING PRELUDE FUNCTIONS OR IMPORTING ANY LIBRARIES. You may make as many helper functions as needed.

Given an n x n array, return the array elements arranged from outermost elements to the middle element, travelling clockwise.

This image will illustrate things more clearly:

IT MUST PASS THE FOLLOWING TEST CASES:

Example: array=[[1,2,3],[4,5,6],[7,8,9]] crawler(array)#=>[1,2,3,6,9,8,7,4,5]