Explain the difference between undecidable problems and unreasonable time algorithms.

We are looking at a “sum-scan” (a scan with addition as the operator).sum-scan has two variants. in an “exclusive sum-scan”, the output at each data element isthe sum of all the input elements that came before that element. in an “inclusive sum-scan”,the output at each data element is the sum of all the input elements up to?