Please write the answer in Pseudocode

Task 7: Consider the following puzzle vector: Element 1 2 3 Element 2 2 Element 3 3 2 4 1 Element 4 2 Design and explain a concrete data structure that implements this puzzle vector. The data structure must only consist of elements that can store an integer or a pointer to another element or null - elements can be indexed if they are contiguous in memory as with an array. You can draw the data structure and explain how the allowed operations of vectors are implemented on this concrete data structure - additional pointers can be created to traverse lists. One approach could be to use arrays, or linked lists, or another approach completely. [6 marks]