A)Lifo- last in first out - the last element added will be removed first.
B)Lilo-last in last out - the last element added will be removed at last.
C)Filo - first in last out - the fist element added will be removed at last.
D)Fifo - first in first out - the first element added will be removed first.
Now queue is a data structure where the first element added will be removed first or we can say that last element added will be removed after removing all the element(except last) means the last element will be removed at last.
So queue is both FIFO and LILO.
SO OPTION (B) AND (D) IS CORRECT.