you give binary string s consist n zero onesYour task divide give stre minimum number subsequence way character string belong exactly subsequence subsequence look like 010101 101010 ie subsequence contain adjacent zero onesRecall subsequence sequence derive give sequence delete zero element change order remain element for example subsequence 1011101 0 1 11111 0111 101 1001 000 101010 11100you answer t independent test case