Write an algorithm replace that takes a queue and two items. If the first item is in the queue, replace it with the second item, leaving the rest of the queue unchanged