what's the complexity of this program in terms of variable 'p'?Code:#include <stdio.h> main(){ int ele,in,data[12],p,k; printf("enter your value for prime p:"); scanf("%d",&p); for(ele=1;ele<=p-1;ele++){ for(in=1;in<=p-1;in++){ if(ele*in%p==1){ data[ele]=in; } } } print: printf("Enter the element you want to check:\n"); fflush(stdout); scanf("%d",&k); printf("Its inverse is: %d\n",data[k]); goto print; }

give a simple function f(p) of p, such as pp, p or 2p, such that the number of

steps is O(f(p)), meaning of the order of magnitude of f(p). To be exact, a function

g(p) is O(f(p)) if there are positive constants c and C such that c <= g(p)/f(p) <= C for all sufficiently large p