ANSWER ASAP!!

Assume a singly linked list that does not store the size explicitly, how to find middle element of this singly linked list in one pass _{(not just in O(n) time but by passing the linked list only once). Write the routine in pseudo code. (Writing O(n) algorithm without one pass will result in partial credit.)}