34. —— OK, $ 500, but that is my last offer.

—— _______.

A．OK, it's a deal.

B．What did you say?

C．Oh, it's up to you.

D．Good idea!

以下函数用来求出数组的最大元素在数组中的下标并存放在k所指的存储单元中。请填空。
#include＜conio.h＞
#include＜stdio.h＞
int fun(int%s, int t, int *k)
int i;
*k=0;
(9)
if(s[*k]＜s[i])*k=i;
return (10) ;
main()
int a[10]=876, 675, 896, 101, 301, 401, 980, 431, 451, 777, k;
fun(a, 10, %k);
printf("%d, %d\n", k, a[k]);