CAN BE MORE THAN ONE

A program to analyze gene sequences represents the genome as a very long sequence of characters. For the sake of this problem, assume that certain character combinations cannot occur legally next to one another. A function in this program will take as parameters that long sequence (the "target") and another somewhat shorter sequence (the "fragment"). It will scan sequentially though the target sequence looking for the first illegal pair of adjacent character codes. It must then update the target by inserting the fragment between those two codes. We want this function to run in O(n) time where n is the length of the target sequence. Which of the following containers would be acceptable candidates for storing these sequences? deque string list vector