using pointer based linked list we want to know the two ways you could identify 20 in the list

first pa 7 10 20 30 40 data next data next data next data next 20 a Guve two names for the location containing b. Given the following node containing 25 r 125 how would you insert it between the nocles containing 20 and 30 in the above diagram. write cft code to do so C write c++ code to delete the node containing 20 d. write ctt code to delete the last node in the 11 st