Not considering validity checks or other error checking, write the one line of linked list-based Stack code to implement Top, assuming Push inserts at the FRONT of the List.
a) list.insert_front(element);
b) list.insert_end(element);
c) list.get_front();
d) list.get_end();