Which of the following assertions about the cyclomatic complexity is false?

		The cyclomatic complexity is used to find out how many independent paths are enough to cover the control flow graph;
		The cyclomatic complexity equals to the number of regions in the control flow graph;
		The cyclomatic complexity equals to the number of predicates plus 1;
		The cyclomatic complexity measures the time complexity of the given program;
		The number of independent paths to discover is always less than or equal to the cyclomatic complexity number.