Please help with this

Question 10 (1 point) In class we have seen a queue implementation that uses a circular array. Consider the array [W, - , K, P) representing a queue where K is the head and - indicates an empty slot. Place in order the following instructions so that the state of the array after they have been executed would be equal to [-, -,W, A, G, P, K, -] enqueue (G)