Design and write, in pseudocode, a backtracking algorithm that, given a graph G = (V, E) (V : vertices, E : edges) and an integer k, determines if there is a set of k vertices of G such that no two vertices in this set have an edge between them.