Create 8-Queens_via_greedy.c

This is the Greedy approach for solving the 8-queens problem. It contains the greedy approach that chooses the minimum number of places covered by a queen and places the queen at position where it covers minimum no of places.