Problem 2: The following pseudocode and flowchart have been designed to get an integer number from the user and print if it is a perfect number or not. Note: a perfect number is a positive integer which is equal to the sum of its proper divisors, excluding itself. For example 6 and 28 are perfect numbers because 6=1+2+3 and 28=1,2,4,7,14. 1: Start 2: num-0 3: sum=1 4: divider - 2 5: Read (num) 6: While ((num/2) >- divider) DO 7: IF (num% divider=0) Then 8: sum-sum+ divider End IF divider=divider + 1 9: 10: 11: End While 12: IF (num=sum AND num != 1) Then 13: Print (num," is a perfect number.") 14: Else Print (num," 15: 16: End IF 17: End. OUTLY is not a perfect number.") B sum sum + divider Start B num = 0 "Input a positive PUT num+ is a perfect number. sum = 1 divider = 2 integere:" num % divider=0 GETmum divider divider + 1 Loop (num/2) > divider Yes sum-num End PUT num+ "is not a perfect number. T A) Trace the algorithm for the following values and show the output: 25, 1, 0, 6, 28 B) Modify the psuedocode or the flowchart in order to print out all the perfect numbers between a range of values given by the user, like 1 and 1000.