Task 1 Specify the definition of data compression and present the general diagrams of lossless and lossy concepts. Task 2 Represent the following numbers: 13 and 22 of 5-bit data alphabet using a) binary code, b) truncated binary code, c) unary code, d) Golomb code (with proposed parameter>1), e) Rice code (with proposed parameter). Task 3 Verify and explain a unique decodability of the codes defined by the following alphabets: Ax1={0,01,001), Akz={1,01,001,000), Akz={01,110,00,111,10), Aka={1,101,011), Aks={1,10} Additionally, construct the binary tree for only one selected code from those given. Task 4 Determine the unique representation of the input data string: COCONUT using the principle of arithmetic coding. Task 5 Describe the procedure for comparing two lossy codecs, which will determine which one is more effective. Define precisely the quality measure and criteria of the experimental comparison