C++程序的时间复杂度为（ ）。
#include <iostream>
#define N 10using namespace std;int path[N][N];
int main() {
for (int i = 1; i < N; i++)
path[i][0] = i;
for (int j = 1; j < N; j++)
path[0][j] = j;
for (int i = 1; i < N; i++)
for (int j = 1; j < N; j++)
path[i][j] = path[i - 1][j] + path[i][j - 1];
cout << path[8][4] << endl;
return 0;
}
O(1)
O(N)
O(NlogN)
O(N2)