The user “JiaT75” inserted a backdoor in a tool for this task that was caught by Microsoft developer Andres Freund in March 2024. Kolmogorov complexity can be conceptualized as measuring an optimal form of this process. (10[1]-5[1])Inputs for this task can be preprocessed by the Burrows–Wheeler transform, which arranges “similar” characters together. One algorithm for this task uses symbol frequencies to construct a prefix tree. (10[1])A family of algorithms for this task is named for Abraham Lempel and Jacob Ziv. (10[2])Shannon’s source coding theorem bounds the efficiency of this process. (-5[1])Huffman codes can be used to perform a “lossless” form of this task. (10[1])For 10 points, name this process that decreases the number of bits needed to store information, (10[1])which can (10[1])create .zip files. ■END■ (10[2])