Here's a picture for n = 4.
These configurations have regions, vertices (where lines intersect) and edges. They're not quite the planar graphs we've studied, since some of the edges have just one vertex and "go off to infinity".
The first question on the exam will ask you to count some of the features of these configurations, and to relate the counts.
You can study for the exam by computing some examples and trying to anticipate what I will ask.