This is a C++ question. Please use node list to solve this problem. Please provide explains on code. Thank you

3 (25 points) No answer yet Create a function that starts from a sequence z of integers of length n and modifies it so that every occurrence of the number 5 is deleted, and every occurrence of number 0 is replaced with three numbers 1. For example if n=8, and x = (1,8,0,3,5,7,0,8), then the resulting sequence is x= (1,8,1,1,1,3,7,1,1,1,8)