(1) Given a queue with elements A,B,C,D,E,F: REAR/Left[F,E,D,C,B,A]FRONT/Right Describe inwordsONLY, the process of enqueue a new element 'G' (i.e, inValue=G) into the queue. (No more than 120 words) (2) In terms of computer resources, comment on the performance difference between the enqueue operation developed by you and that based on the linked-list approach. (No more than 100 words)