Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a binary string binary consisting of only 0's or 1's. You can apply each of the following operations any number of times:

Operation 1: If the number contains the substring "00", you can replace it with "10".

	
For example, "00010" -> "10010"


Operation 2: If the number contains the substring "10", you can replace it with "01".
	
For example, "00010" -> "00001"



Return the maximum binary string you can obtain after any number of operations. Binary string x is greater than binary string y if x's decimal representation is greater than y's decimal representation.
 
Please complete the following python code precisely:
```python
class Solution:
    def maximumBinaryString(self, binary: str) -> str:
```