<p>You are given a binary string <code>binary</code> consisting of only <code>0</code>'s or <code>1</code>'s. You can apply each of the following operations any number of times:</p>
<ul>
<li>Operation 1: If the number contains the substring <code>"00"</code>, you can replace it with <code>"10"</code>.
<ul>
<li>For example, <code>"<u>00</u>010" ->"<u>10</u>010</code>"</li>
</ul>
</li>
<li>Operation 2: If the number contains the substring <code>"10"</code>, you can replace it with <code>"01"</code>.
<ul>
<li>For example, <code>"000<u>10</u>" ->"000<u>01</u>"</code></li>
</ul>
</li>
</ul>
<p><em>Return the <strong>maximum binary string</strong> you can obtain after any number of operations. Binary string <code>x</code> is greater than binary string <code>y</code> if <code>x</code>'s decimal representation is greater than <code>y</code>'s decimal representation.</em></p>