Figure out the worth of Bresenham's circle drawing method's decision parameter p. Is Bresenham's algorithm for drawing a circle laid out in a step-by-step manner?

Are there any issues with using adjacency lists to depict a weighted graph?

Find out what number p should have for the Bresenham's circle drawing technique's choice parameter. Here are step-by-step steps for how Bresenham came up with his method for making a circle.

For diagrams with three arcs, there are 15 possibilities. considering the following set of arcs: arcs = [(0, 1), (0, 2), (1, 2)] This set of arcs should result in 1 crossing and 2 nestings. However, let's check the function's output: crossings, nestings = count_crossings_and_nestings(arcs)print(f"Number of crossings: {crossings}")print(f"Number of nestings: {nestings}") This outputs: Number of crossings: 0Number of nestings: 0 My questions I need help from you: The first problem is related to the variable n and its value. Explain what goes wrong. Provide a better implementation of the function, avoiding the use of n. Use the same function name, i.e., count_crossings_and_nestings.