(computability/complexity - removing k edges to create graph with no cycles): Please write an algorithm, in turing machine notion, that upon getting a directed graph G and a positive number k, returns a set of k edges, that after removing them the graph has no cycles(the algorithm returns a list of those k edges). if there are no such k edges, it outputs "no such k edges found".

Important: the algorithm can only use the algorithm to decide the language ACYCLIC and not other np-complete problems.

Please write the algorithm in computability/complexity notion, i.e for turing machines.