Answer the following question (smarks each) 1. When a data structure is extremely time-consuming to evaluate. it denotes with. maximum time - worst time - average time 2- Which data structure allows deleting data elements from front and inserting at rear? 3- In doubly linked list, insertion of node requires modification of ? One pointer - Two pointer - Pointer of head node 4- In linked list each node contain minimum of two fields. One field is data field to store the data second field is _.. ? 5- Worst case indicates maximum time required for program execution? 6- A Binary Tree can have Can have 2 children - Can have 1 children Can have 0 children - All of the above 7- Height of Height of a binary tree is 8- Path of any node in binary tree is 9- Can queue be implemented using single linked list? 10- What the property in a case dequeuing from queue