Problem Statement: You are tasked with determining if a given year is a leap year. Apply the 4-step problem-solving process to design an algorithm.

Problem Statement: Write a basic pseudocode algorithm to calculate the area of a rectangle.

Problem Statement: Trace the logic to find the largest of three numbers. Assume inputs are A=10, B=25, C=5.

Problem Statement: Trace a WHILE loop that prints numbers from 1 to 5. The loop condition is count <= 5.

Problem Statement: Compare two algorithms designed to find a specific number in a sorted list of 100 elements. Algorithm A checks every single element one-by-one (Linear Search). Algorithm B halves the search space repeatedly (Binary Search). Determine their time complexities.

Problem Statement: Analyze the following pseudocode for a simple array sorting algorithm. Trace its execution on the list [5, 1, 4].

SET A = [5, 1, 4]
SET n = length(A)
FOR i = 0 TO n - 1
    FOR j = 0 TO n - i - 2
        IF A[j] > A[j+1] THEN
            SWAP A[j] AND A[j+1]
        END IF
    END FOR
END FOR