Answer:1. Pseudocode for area and perimeter of a trapezoid (Let the two bases be b1 and b2, the height h, and the non-parallel sides s1 and s2.) ``` BEGIN INPUT b1 // length of first (top) base INPUT b2 // length of second (bottom) base INPUT h // height INPUT s1 // length of one non-parallel side INPUT s2 // length of the other non-parallel side // Area formula: ½·(sum of bases)·height area ← ( (b1 + b2) / 2 ) * h // Perimeter: sum of all four sides perimeter ← b1 + b2 + s1 + s2 OUTPUT "Area =", area OUTPUT "Perimeter =", perimeter END ```2. Algorithm to find the median of a list of numbers (Works for any count N ≥ 1; if N is even, returns the average of the two middle values.) ``` BEGIN INPUT N // number of elements FOR i FROM 1 TO N DO INPUT A[i] END FOR // 1) Sort the array A in non-decreasing order SORT A[1..N] // 2) Compute median IF N MOD 2 = 1 THEN // odd count → middle element median_index ← (N + 1) / 2 median ← A[median_index] ELSE // even count → average of two middles i1 ← N / 2 i2 ← i1 + 1 median ← (A[i1] + A[i2]) / 2 END IF OUTPUT "Median =", median END ```