Given the Doubly Linked List implemented as a circular list with one dummy node as presented in class, answer the questions below by selecting or typing the correct answers. 1. Within function empty(), write the Boolean expression to determine if the list is empty. Do not put spaces in your answer. That is, X==Y is okay, but X == Y is not. 2. True or False: Removing the last element from the list conditionally requires setting _sentinel. _next to nullptr. 3. Implement push_front(data) in 5 lines of code. Do not separate identifiers and operators with spaces, but do separate identifiers with a single space. That is, X=Y and new Data are okay, but X = Y, newData , and new Data are not. Don't forget your semicolon