how to write DDPG Algorithm at case of L2 Regularization, ADAM Optimization and Number-of-​steps-to-l​ook-ahead ?

I would like to inquiry how to write the DDPG algorithm if L2 Regularization, ADAM optimization and certain number of steps to look ahead exist in the code ?

i want to know the whole sequence in details like :

1- how the transitions are stored in replay buffer based on certain number of steps to look ahead

2- how could be the shape of cost function if L2 Regularization exist

3- how does adam optimizer works at this case