$($i$)$ Write a procedure to find the midpoint $($i$.$e$.,$ the middle node$)$ of a singly linked list

using two parallel passes through the list.

$($ii$)$ How can you count the size $($number of nodes$)$ of a read$-$only singly linked list $($i$.$e$.,$ you

cannot make changes to it$)$ that has a cycle $($i$.$e$.$ there is no pointer to tail and the last

node points to another node of the list instead of pointing to null$)?$ You do not need to

write code or pseudo code. Writing only the steps and technique would suffice.