Please help with python coding, follwing this exact psuedo code Overview: Find the middle node of a singly linked list.

Pseudo Code:

$```$

FUNCTION find$\_$middle$\_$node$($linked$\_$list$)$

INITIALIZE slow and fast pointers to the head of linked$\_$list

WHILE fast and fast.next are not None

MOVE slow one step forward

MOVE fast two steps forward

RETURN slow $($middle node$)$

END FUNCTION

$```$

Implementation Guide: $-$ Use two pointers: slow and fast. slow moves one node at a time, while fast moves two nodes. $-$ When fast reaches the end of the list, slow will be at the middle. $-$ Return the node pointed to by slow.