Assume that you will design a programming language with Dynamic and Flexible Arrays: arrays whose dimensions are not known until storage is allocated for an array, and the size can change (grow/shrink) after that. Briefly explain among static data area, stack and heap, which memory regions are proper for such arrays. Moreover, briefly describe how bounds checking would be supported. You should consider both one- and multi-dimensional arrays.