Redirected
retagged by
1,369 views
4 votes
4 votes

retagged by

3 Answers

3 votes
3 votes

The answer is Option B.

These sequences are known as arithemetico - geometric progression summation series.

1)

2)

P.S: Sorry for clarity and handwriting.   :)

Answer:

Related questions

0 votes
0 votes
1 answer
1
Naveen Pandey asked Jan 8, 2017
487 views
T(n)=2T(log n)+c c is a constant. Base condition is if(n<2) return 1What will be the tightest bound on time complexity?
0 votes
0 votes
1 answer
2
saptarshiDey asked Jan 3, 2019
8,077 views
What will be the worst case time complexity for the following code segment?int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } }Option...
2 votes
2 votes
1 answer
3
aka 53 asked Nov 22, 2017
955 views
for i < - 1 to n for j < 1 to n/2 X = X + 1(i and j both are incrementing by 1)Outer runs for n times and inner for n/2 So will it be n(n...