One operation we can define for an implementation of the List ADT is RemoveAll$($x$),$ which will remove all instances of a specified element x in the list. Use pseudocode to describe an implementation of RemoveAll that runs in linear time, where the list is implemented using: $($a$)(15$ points$)$ An array. $($b$)(15$ points$)$ A doubly$-$linked list.