a) Let n be a positive integer. Consider the following algorithm segment: X=0; for i=1 to n { for j=1 to i{ for k=i+1 to n {
X=X+1;
}
}
} Derive the number of additions (+) performed by this code segment. Note that your answer should be an expression in n.
