Write an Answer Set Programming (ASP) program to find a maximal strongly independent set in a graph. A set of vertices is strongly independent if no two of its vertices are connected with an edge and no two of its vertices have a common neighbor. It is a maximal strongly independent set if no vertex can be added to it without breaking the strong independence property.

Use your program to find a strongly independent set for the two graphs above (with n = 30).

1 3 5 2n-3 2n-1 60 2n-2 2n 5 2n-3 2n-1 21- 2n-2 2n 1 3 5 2n-3 2n-1 60 2n-2 2n 5 2n-3 2n-1 21- 2n-2 2n