<prompt> Kutokana na strings s na t, kama kuna string t katika s kuondoa tukio kushoto. kufanya hivyo tena na tena mpaka hakuna t katika s. Andika katika C .  <response>: Heres an example code in C that removes the leftmost occurrence of string t in string s until there are no more occurrences:include include using namespace std;int main string s, t; size_t pos; input s and t cout Enter string s: ; getlinecin, s; cout Enter string t: ; getlinecin, t; remove leftmost occurrence of t in s while it exists while pos s.findt ! string::npos s.erasepos, t.length; output the resulting string cout Result: s endl; return 0;In this code, we first read the input strings s and t using getline. We then use a while loop to remove the leftmost occurrence of t in s using the string::find and string::erase functions. The string::find function returns the position of the first occurrence of t in s, or string::npos if its not found. The string::erase function removes a substring from s starting at the given position with the given length.We keep doing this until there are no more occurrences of t in s. Finally, we output the resulting string using cout. 