Codewriting Python 3 main.py3 Saved def solution (blocks, height): You are given array of integers called blocks . Each of the values in this array represents the width of a block - the ith block has a height of 1 and a width of blocks[i] (i.e. it's a 1 x blocks (1) block). You want to pack all the given blocks into a rectangular container of dimensions height x width , according to the following rules: . Place blocks into the container row by row, starting with block . For each row, place the blocks into the container one by one, in the order they are given in the blocks array. • If there is not enough space to put the current block in the current row, start filling the next row. You are given the value height of the rectangular container. Your task is to find the minimal possible width of a rectangular container in which all blocks can fit. Find and return this minimal possible width value. TESTS CUSTOM TESTS RESULTS O RUN TESTS NOTE: The blocks cannot be rotated. A Tests passed: 0/26. Syntax error. Example Test 1 . For blocks - [1, 3, 1, 3, 3] and height - 2. the output should be solution (blocks, height) - 6 Input: blocks: [1, 3, 1, 3, 3] height: Here's how the blocks should be packed in a container size 2 X6 6 Expected Output: LILL-HD-T.