Assume that this ADT has two different different methods to delete all the elements from the singly linked list as follows: void delete_all_from_start() { while (size > 0) delete_nth (0) return void delete_all_from_end () 30 while (size > 0) delete-nth (size - 1) * return Give the complexities of these two methods in big O notation and explain how you derived them. Write the pseudocode for a much simpler and more efficient method to delete all elements from the list. [10 marks]