the contents at the end of the current line vector starting at the cursor position will form the new line we first extract and save this text by creating slice from the current line the part of the vector from which we created the slice is then deleted and newline character is appended we use the insertnode(helper method to then insert new line into the buffer the helper method inserts new node following the one pointed to by curline and containing the supplied contents the last step required in breaking the current line is to move the cursor to the front of the new line exercises evaluate the four basic linked list operations for sorted doubly linked list and indicate the worst case time-complexities of each evaluate the worst case time-complexity for the search operation on doubly linked list using probe pointer evaluate the worst case time-complexity of the sparse matrix adt implemented in programming project provide the code to implement the four basic operations -traversalsearchinsertiondeletion -for an unsorted doubly linked list provide the code to delete node from sorted doubly linked list provide the code to delete node from sorted singly linked circular list programming projects complete the implementation of the editbuffer class from section modify the moveleft(and moveright(methods to accept an integer to indicate the number of spaces to move in the respective direction modify the editbuffer class to include the following operationsgetpagefirstlast )returns vector of strings consisting of the rows [first last]which can be used for displaying page of text insertstringstr )inserts string of text within the current line starting at the current cursor position movetolinendxcolndx )moves the cursor to the indicated position within the buffer if linendx is out of rangeno action is taken if colndx is larger than the current linethen the cursor is positioned at the end of that line