Assume that a given message m has to be padded to fit a size…

Assume that a given message m has to be padded to fit a size of a multiple of 512 bits before the actual hash computation. The following bit string is m consisting of five 8-bit ASCII characters with a total length of 40 bits. How many zeros would be added? 0110000101100010011000110110010000101101