(SCHEME R5RS)Can anyone help me solve this in two ways(with prime? and without)? and walk me through each line of the code? Thanks

Give a SCHEME program prime-reciprocals so that (prime-reciprocals n) returns the sum of the reciprocals of all prime numbers between 2 and n. For example (prime-reciprocals 5) should return 1/2 + 1/3 + 1/5 because 2, 3, and 5 are the only prime numbers less than or equal to 5. Note that (prime-reciprocals 6) would actually return exactly the same value. You may assume in your solution that prime? is already defined, so that (prime? n) will return #t when n is a prime number and #f otherwise. You do not need to implement this.