chore(Python) : add GCD using recursion following Euclid's Algorithm

[WORLDSAVER]

PR Checklist:

• [x] My submission is formatted according to the guidelines in the contributing guide
• [x] My addition is on refer on the language README.md file
• [x] My addition does not have a spelling problem
• [x] My submission has a proper and user-friendly description of the algorithm
• [x] My submission has the time complexity of the algorithm
• [x] My submission has sample input-output of the program (NOT FOR PYTHON)

What kind of change does this PR introduce? (check at least one)

• [ ] Bugfix
• [x] New algorithm
• [ ] Optimization in previous algorithms
• [ ] Code style update
• [ ] Refactor
• [ ] Documentation
• [ ] Other, please describe:

Briefly describe the changes in this PR

Other information:

[welcome[bot]]

Thanks for opening this pull request! Please check out our contributing guidelines.

[WORLDSAVER]

@Arsenic-ATG please review and allow the merge.

[WORLDSAVER]

Hi @Arsenic-ATG, I have done all the changes and also all the tests have been passed please review and allow merging.

[WORLDSAVER]

Hi @ming-tsai can you please merge this commit. It has been approved by @Arsenic-ATG . Thanks!

[welcome[bot]]

Congrats on merging your first pull request! We here at MakeContributions are proud of you! 🎉🎉🎉🎉. You are invited to join the team on Github and Discord.