Design and implement an undo$/$redo functionality for a text editor using a stack data structure. This system will enable users to revert to previous states of the document and reapply undone changes efficiently. The stack data structure is ideal for this application due to its Last$-$In$-$FirstOut $($LIFO$)$ behavior, which aligns with the typical requirements for undo and redo operations.Requirements:

Text Editing:

Add Text: Users should be able to add text to the document.

Remove Text: Users should be able to delete text from the document.

Undo Operation: Implement a function to revert the last change made to the document.

This requires maintaining a history of changes that can be undone.

Redo Operation: Implement a function to reapply a change that was previously

undone. This requires maintaining a history of undone changes that can be redone.

Save and Restore State:

Save State: After each edit $($addition or removal of text$),$ save the current state of the

document to the undo stack.

Restore State: Retrieve and apply the most recent state from the undo stack during an undo operation.

d$)$ Design an extended feature for the text editor that supports unlimited levels of undo

and redo. Describe how you would modify the stack$-$based implementation to handle

multiple layers of undo$/$redo operations, ensuring that the system remains efficient and

user$-$friendly. $($Create$)$

use only c language