Can someone solve this?
Also please attempt this question on Algorithms time complexity if interested :)
https://gateoverflow.in/210836/algorithms-time-complexity
..
Biconnected components are ${\{1,2,4\}, \{3,9,10\}, \{6,7,8\}, \{15,17,16\}, \{20,21,22\}, \{18,23,24\}}$.
Note that they all are K_{3}. which do not contain any articulation point and bridges.
Total biconnected component is 16
----> 1,2,4,7,8,9,10,12,13,14,16,17,21,22,23,24.
So answer is none of these.
@abhishekmehta4u but it is mentioned in the question that it should be "maximal".