Simpson's paradox in a table

You will write functions that find a pass rate, an overall rate, and whether a table shows Simpson's paradox. The checker uses the tutoring centre of the lesson.

The idea. A table is a dictionary: for each method, a dictionary of groups, each with (passed, total). The paradox happens when one method wins in every group but loses overall.

Your tasks.

1. Finish rate(passed, total). Return a percentage.
2. Finish overall(groups). Add the passes and the totals of all groups first.
3. Finish is_paradox(table, first, second). Return True when first beats second in every group but not overall.