Suppose, you are working on fraud analysis, and you need to check if a group has a few discrete bad behaviors or is acting as a systematic collection of entities, which of the following graph algorithms might be ideally suited?

	(a)	Triangle count
	(b)	Connected components
	(c)	Strongly connected components
	(d)	Page rank
	(e)	Fast unfolding algorithm