Are you sure you're getting this? Fill in the missing part by typing it in.

To find the middle element of a linked list, we can use the ___ approach. The slow pointer moves ____ node at a time, while the fast pointer moves ____ nodes at a time. By the time the fast pointer reaches the end of the list, the slow pointer will be at the middle element.