Exercise $3.$ An alternative to the deletion strategy for the list ADT is to use lazy deletion. To delete an element, we merely mark it deleted $($using an extra bit field$).$ The number of deleted and nondeleted elements in the list is kept as part of the data structure. If there are as many deleted elements as nondeleted elements, we traverse the entire list, performing the standard deletion algorithm on all marked nodes.

a$)$ List the advantages and disadvantages of lazy deletion.

points