Question 9 5 pts Proper way to remove stack element using SLL All the answers horst -hirst->next; tempe first: Post-est-next; delete tmp: temp-first first instext delete first Question 10 5pts Proper way to Insert stack element using SLL tmpe forst: torst new Nodel torst->next = tmp first->next = new Nodel All the answers first->next oldest Question 11 5 pts Proper way to remove Queue element using SLL All the answers tempe first first-first->next; delete tmp first-first->next tempe first first first->next; delete first Question 12 6 pts Proper way to insert Queue element using LL tmp - last: Last-new Nodielomp->next Last aldfirst->next last All the answers tmp-last last-new Nodel tmp-next last-et-NULL: D Question 13 5 pts What is bad about implementing queue using dynamic array Al it is impossible to implement since removing top of the array may cause segmentation fault B} By performing dequeue Oleaves too many unused space at the top of the array Since dynamic array fored size enqueue Is Ilmited B All the answers Question 14 5 pts What is true about using templates Not compatible with certain data types Help developer to write one generic code that his most of the data types All the answers Templates in the performance of the program D Question 15 5 pts Assume you have numbers 100 99 88 20 and do the following stept) install to a Bounded Queue respectively step 2)Remove it from Queue and insert to a sack step 31 Remove each letter from stack and print it out Your output will be 99 100 02 68 0288 99 100 100 99 8820 Not any of these since we use Bounded Queue