5) Assume a singly linked list. Management occasionally requires access to the node immediately preceding the current node pointed to by At." Write the algorithm to find the node preceding the node pointed to by At. A list may contain a 1000 or more nodes. Be sure you cover all possible cases. Some sample List: Sample 1: Pt1 >Tom > Jill Sam 0 - A Sample 2: Panopti > Tom 1 2 > Jill 1 Sam At Sample 3: Pt162 At Sample 4: Pt1 Sample time = > Tom | 03 > Tom > Jill *Sama Sam 10 AT