Write a program $/$ an algorithm that takes in the head of a Singly Linked List, and print the $N^{th}$ element from the last. $.$ LinkedList node has an integer value as well as a next node pointing to the next node in the list or to None$/$null if it's the tail of the list. You can assume that the input LinkedList will always have at least one node; in other words, the head will never be None$/$Null$.$

$[5$ Marks$]$

Sample Input

head $=012345//$ the head node with value $0$

$N^{th}$ from last: $2$

Sample Output

Subject : DATA STRUCTURES WITH C

SEND SOLUTION ASAP