<prompt> Tumia jenereta ya nambari ya nasibu kutoka mwanzo katika C .  <response>: Here is an implementation of a simple random number generator in C using the linear congruential method:include include unsigned long long seed std::chrono::system_clock::now.time_since_epoch.count; Seed based on current timeunsigned long long a 6364136223846793005;unsigned long long c 1442695040888963407;unsigned long long m 0x7fff; Largest 64-bit prime numberunsigned long long rand seed a seed c m; return seed;int main for int i 0; i 10; i std::cout rand std::endl; return 0;This generates a sequence of 64-bit unsigned integers using the formula seed a seed c m. The values of a, c, and m were chosen to provide good randomness properties. The initial seed is set based on the current time, so you should get a different sequence of numbers each time you run the program. 