Please write a function in Haskell which does the following, without using any prelude functions or importing any libraries. Make relevant helper functions where needed.

Question 10 - Clockwise Crawler: Given an nn array, return the array elements arranged from outermost elements to the middle element, travelling clockwise. This image will illustrate things more clearly: Example: array=[[1,2,3],[4,5,6],[7,8,9]] crawler(array)#=[1,2,3,6,9,8,7,4,5] Note: No imports are allowed