By using your implementation of Iterated Local Search, and appropriately configuring the framework, find a configuration for iIntensityOfMutation (IOM) and iDepthOfSearch (DOS) such that Iterated Local Search performs better than DBHC alone when comparing their median performances for solving MAX-SAT instance 1 with a 10 second computational time budget.

For full context, here is the boxplot produced when running DBHC for 31 trials on MAX-SAT instance 1 given 10 seconds of runtime using the seed of -1414736884 ("hill climbing".hashcode()) from the previous lab exercise: