Articulation Points

### Description
Take an undirected graph with N vertices and M edges as the input. Find all the articulation points of the graph.

### Details
- Technical Specifications: C/C++/Python/Java/Go
- Type of issue: Single
- Time Limit: 1 day after being assigned the issue

### Issue requirements / progress
- The solution should be efficient in terms of time and space complexity

### Resources
https://xlinux.nist.gov/dads/HTML/cutvertex.html

### Directory Structure
Create a Folder "1_Articulation_Points" under the "Algorithms" directory and within it add your file with the same name.

#### Note
1. Please claim the issue first by commenting here before starting to work on it.
2. Once you are done with the task and have created a Pull Request, please tag @DeltaCube23 to request a review.

Start with the articulation-points definition in the linked NIST resource, then create the requested 1_Articulation_Points folder under Algorithms and add the implementation file with the same name. Done means the chosen C, C++, Python, Java, or Go solution efficiently finds all articulation points for the given undirected graph.

Written by the indexing model from the issue text.