Suppose that a computer program is available for computing the DFT i.e., the in...

Suppose that a computer program is available for computing the DFT

i.e., the input to the program is the sequence x[n] and the output is the DFT X[k]. Show how the input and/or output sequences may be rearranged such that the program can also be used to compute the inverse DFT

i.e., the input to the program should be X[k] or a sequence simply related to X[k], and the output should be either x[n] or a sequence simply related to x[n]. There are several possible approaches.