Can you solve this?
1 int find_max(int nums [], int len)
2{
31 int i, max_num = nums [0];
41 for (i = 1; i < len; i ++)
51 1 if (nums [i] > max_num)
61 II II (Fill in the missing Line here)
71 return max_num;
8 }
A. nums[i] = max_num
B. max_nun + 1
C. max_num = nums (1)
D. max_num te nums (i)
