PLS USE PYTHON TO DO THIS PROGRAM , THANKS SO MUCH!!

2. The Nagel-Schreckenberg cellular automata (30 points) (a) (20 pts) Starting from the simple traffic model discussed in the lecture, write a code implement ing the rules of the Nagel-Schreckenberg model (see page 11 of the lecture notes). We want to consider, in particular, a model with 100 cells which are as in the lecture periodically connected. The maximally allowed velocity is 5 in units of cells (b) (10 pts) As initial state, place 10,20,50 cars at equal distances, all with velocity 1. Consider a randomization p 0.3 (probability that velocity is reduced by 1). To implement the random- ization of the velocities you can use the np.random routines, see numpy documentation. Plot the time evolution for 100 time steps in the three cases. In which cases do traffic jams occur