The circular queue-based implementation of the queue can also be represented in a circular. For instance, the below figure shows a circular queue with a capacity of 7. Each circular queue has two pointers, i.e., front and rear. Front tracks the index of the first element, and rear tracks the index of the last element in the queue. Given the above information, determine if the following statement is True or False. "If rear > front, the current number of data items in the circular queue is rear-front." True False Array-based List is not preferred for implementing a Stack, compare to LinkedList, as it takes O(n) to push and pop one element. True False If a sequence of data points, i.e., {a,b,c,d,e,f,g} has been pushed into a Stack following the given order, which of the following can be the output of pop? (select all that apply) Note: different output sequences can be generated because pop and push calls can be combined differently. E.g., push(a) and pop(), and then push(b), etc. {f,e,g,d,a,c,b} {c,d,b,e,f,a,g} {d,e,c,f,b,g,a} {e,f,d,g,b,c,a}