<prompt> Kuandika boggo aina katika C .  <response>: Heres an example implementation of the bogosort algorithm in C:include include include include bool is_sortedconst std::vector nums for int i 0; i nums.size - 1; i if numsi numsi 1 return false; return true;void bogosortstd::vector nums srandtimeNULL; seed the random number generator while !is_sortednums for int i 0; i nums.size; i int random_index rand nums.size; std::swapnumsi, numsrandom_index; int main std::vector nums 3, 1, 4, 1, 5, 9, 2, 6; bogosortnums; for int num : nums std::cout num ; std::cout std::endl; return 0;This implementation randomly shuffles the input vector until it is sorted, using the is_sorted helper function to check if the vector is sorted. Note that bogosort is not a practical sorting algorithm and its performance is generally terrible. 