Imagine you had the program k, which outputs the kolmogorov complexity of string. design a program p that when given integer n outputs the bit string of length n with the highest kolmogorov complexity. if there are multiple strings with the highest complexity, output the lexicographically first (i. e. the one that would come first in a dictionary).