Code the following problem in python:

The Mandelbrot set is an example of a fractal: an object that contains a structure within a structure, iteratively as far as we care to look. Consider the following iterative equation (all variable:s represent complex numbers) The Mandelbrot set considers a complex number c and sets zo-0.The above equation is applied iteratively until lzl is above 2 or until z has been updated many times (to z0, say). If Izl is not found to ever exceed 2, then the point c is in the Mandelbrot set; if it does exceed 2, it is not in the Mandelbrot set 1. Consider a complex number in the formc-x+iy. Consider a100x100 grid of points on the complex plane constrained by -2SxS 2 and-2sys2 For each value of c on this grid, determine the number of iterations required for lzl to exceed 2. If lzl does not exceed 2, record the maximum number of iterations considered instead Record these values on a100x100NumPy array 2. 3. Save the array formed in step 2 to file. Then comment out the analysis code and instead load your results from file. (This speeds things up as you play around in the following step!) Plot the array constructed in step 2 using pit, imshow(array,