QUESTION 16 Reversing a string is an example of a queue application. True False QUESTION 17 If two elements in the priority queue have the same priority, FIFO principle will be used. True False QUESTION 18 Priority queue data structure is required to convert the infix to prefix notation. True False QUESTION 19 For a linear search in an array of n elements the time complexity for best and worst case are O(n). True False