What is the total number of steps required to find a maximum element based on the algorithm below. #include } int main() { int array[100], maximum, size, c, location = 1; printf("Enter the number of elements in array "); scanf("%d", &size); printf("Enter %d integers ", size); for (c = 0; c < size; c++) scanf("%d", &array[c]); maximum = array[0]; for (c = 1; c < size; c++) { if (array[c]> maximum) { } maximum = array[c]: location =c+1; printf("Maximum element is at location %d, it's value is %d. ", location, maximum); return 0;