1. Consider the pseudocode segment given below, where i, j, k, and l are counting numbers. How many times is the print statement executed in this pseudocode segment? Give your answer in terms of n and justify (prove) it. for i:=1 to n do for j :=1 to i do for k:=1 to j do for := 1 to k do print("I love graph theory") end do; end do; end do; end do;