Assume that a multi-meme memetic algorithm is run for 50 trials on the problem instance Inst with an innovation rate of 0.2 based on the memplex of p#o#, which identifies the choice of probability (p) of applying the operator indicated by (o). The meme options are p={0: 0.005, 1: 0.01, 2: 0.02, 3: 0.03, 4:0.5, 5:0.9} and o={0:randomSwap, 1:insertion, 2:randomReversal, 3:adjacentSwap}. Given the mean evolutionary activity plot above, which of the following conclusions can be driven about the search behaviour of the multi-meme algorithm?