ASAP PLS

1.ut.edu.jo/montrattempt php attempt=:1 JT E-LEARNING a Structures and Introduction to Algorithms - All ion Define the SLL member function int speciaDecrement(int v), which finds the last node whose value is a multiple of 5 and replaces the value in the node before it with v. if no value in the list is a multiple of 5. or if the only multiple of 5 is value is in the first node, then the function does no decrement and returns-77 For example, if the list was (15, 21,9,30, 111 then after executing speciaDecrement( 4), it will become [15,24.5.30.111 and the function returns 9. it of Also, if the list was 1207.54.17), then after executine speciaDecrement 4 the list remains (20,7,54,171 and the function returns -77. Below is the SLL API you are allowed to use to solve this question: class SLLL private: Node* h/stores the address of the first call in the list Node*t;//stores the address of the last cell in the list public Il constructors SLLO: -SLLO