2. (10 points) Let Equeue = (B,C,F,P,T) where: a. B = {Element, Queue}. b. C = {error, empty). c. F= {front, back, enqueue, dequeue}. d. P=0. e. Terror) = Element. f. 7(empty) = Queue. g. 7(front) = Queue Element. h. T(back) = Queue Element. i. T(enqueue) = Element Queue Queue. j. T(dequeue) = Queue Queue. Construct in MSFOL a theory T = (Equeue, I'queue) of queues. I queue should contain axioms that say: a. The front of an empty queue is the error element. b. The front of a singleton queue is the single element in the queue. c. Let q be a queue obtain by enqueuing e to a nonempty queue q'. The front of q is the front of q. d. The back of an empty queue is the error element. e. Let q be a queue obtain by enqueuing e to a queue d'. The back of q is e. f. The dequeue of an empty queue is the empty queue. g. The dequeue of a singleton queue is the empty queue. h. Let q be a queue obtain by enqueuing e to a nonempty queue . The dequeue of q is the enqueue of e to the dequeue of q'. 2. (10 points) Let Equeue = (B,C,F,P,T) where: a. B = {Element, Queue}. b. C = {error, empty). c. F= {front, back, enqueue, dequeue}. d. P=0. e. Terror) = Element. f. 7(empty) = Queue. g. 7(front) = Queue Element. h. T(back) = Queue Element. i. T(enqueue) = Element Queue Queue. j. T(dequeue) = Queue Queue. Construct in MSFOL a theory T = (Equeue, I'queue) of queues. I queue should contain axioms that say: a. The front of an empty queue is the error element. b. The front of a singleton queue is the single element in the queue. c. Let q be a queue obtain by enqueuing e to a nonempty queue q'. The front of q is the front of q. d. The back of an empty queue is the error element. e. Let q be a queue obtain by enqueuing e to a queue d'. The back of q is e. f. The dequeue of an empty queue is the empty queue. g. The dequeue of a singleton queue is the empty queue. h. Let q be a queue obtain by enqueuing e to a nonempty queue . The dequeue of q is the enqueue of e to the dequeue of