<prompt> Hesabu lexicographically ijayo bit kubadilishana katika C .  <response>: You can use the std::next_permutation function to compute the lexicographically next bit permutation in C. Here is some sample code:include include using namespace std;int main string bits 0011; input bit string sort the bit string in lexicographical order sortbits.begin, bits.end; generate all possible permutations of the sorted bit string do cout bits endl; while next_permutationbits.begin, bits.end; return 0;This code first sorts the input bit string in lexicographical order, then generates all possible permutations of the sorted bit string using the std::next_permutation function. Each permutation is printed to the console. The first permutation printed will be the input bit string, and subsequent permutations will be in lexicographically increasing order. 