We wish to implement a Block ADT, which stores a sequence x$0,$ x$1,...,$ xK$1$ of fixed length K and supports the following operations. $$ Index$($i$)$ returns xi$.$ Insert$($i$,$ x$)$ inserts element x in the ith position of the sequence, and removes and returns the last element. This operation changes the sequence from x$0,$ x$1...,$ xK$1$ to x$0,$ x$1,...,$ xi$1,$ x$,$ xi$,$ xi$+1,...,$ xK$2$ and returns xK$1.$ ShiftRight$($x$)$ is equivalent to Insert$(0,$ x$).$ Give a simple implementation of this ADT so that Index and ShiftRight each run in O$(1)$ time and Insert runs in O$($K$)$ time. Explain how your data structure represents the sequence in memory. You can either give a brief