Measure the actual worst$-$case performance of your function longest$\_$common$\_$substring for a range of suitable inputs. You will need to make a number of measurements to see how the timing varies as L or R increases.You may find it useful to recall that arithmetic operators such as $+$ and $*$ can be applied to strings to conveniently define very long strings.For example: