1. For each statement, decide whether it is True or False. (a) (2 points) A stack follows a FIFO (first-in-first-out) rule. (b) (2 points) O(n2) is the worst case scenario of Big O for the Mergesort algorithm