Formal language problem. Designing a double-tape TuringMachine

Design a double-tape TM that counts the number of 1’s of a binary number and writes it as an unary number. Requirements Input is written on tape 1. Output should be written on tape #2. If input contains only zeroes, then output shows
PayPal Gateway not configured
PayPal Gateway not configured