Given an undirected graph with N vertices and M edges. How toIn how many ways we can choose K vertices, such that after removing them, the graph remains still remains connected? I know we can find Articulation points when k=1, but not able to understand what to do for k>1. <br/>↵
1<= **N** <=50 , N-1<= **M** <=(N*(N-1)/2) and 0<= **k** <=N.<br/>↵
Link to question [Link](https://drive.google.com/file/d/1xpQNDdEwfXQACQRSjObe4nNf8a58MuVy/view?usp=sharing)↵
↵
**UPD** There was a mistake from my side. There was a typo in the question. I have corrected it now.↵
1<= **N** <=50 , N-1<= **M** <=(N*(N-1)/2) and 0<= **k** <=N.<br/>↵
Link to question [Link](https://drive.google.com/file/d/1xpQNDdEwfXQACQRSjObe4nNf8a58MuVy/view?usp=sharing)↵
↵
**UPD** There was a mistake from my side. There was a typo in the question. I have corrected it now.↵
