Added major simplifications to the Exercise 5 Solution (Looping Graph)

[NarinCodes]

Refined the logic in Exercise_Graph5.ipynb to be more generalizable

• The setup_node function no longer has any hardcoded bounds; it will dynamically generalize to user-specified input bounds
• Simplified the hint_node function to have cleaner and more straightforward bound reassignment (previously there was min/max logic which was redundant)
• Removed the unnecessary and redundant else condition in the guess_node function. If coded correctly, the if condition will inevitably lead to the correct number or result in exhausted attempts
• Made the final invocation more similar to a typical user-journey. User only specifies their name and lower/upper bounds — everything else (guesses, attempts, etc.) should be gracefully handled behind-the-scenes by the graph