Challenge #164 [Easy] Assemble this Scheme into Python

easy164-1.rb

puts "Hello World"

easy164-2.rb

# initialize an array of 100 elements
a = Array.new(100)
i = 0
count = 0
while count < 100 do
  # looking for 100 successfull adds
    if i % 3 == 0 && i % 5 == 0
        a[count] = i
        count += 1
    end
    i += 1
end 

print a
print "\n"

easy164-3.rb

puts "Enter first potential anagram to evaluate:"
a = gets.chomp
puts "Enter second:"
b = gets.chomp

if a.upcase.chars.sort.join == b.upcase.chars.sort.join
    puts "Confirmed! Anagram detected!"
else
    puts "\"" + a + "\" is not an anagram of \"" + b + "\""
end

easy164-4.rb

puts "Enter word:"
word = gets.chomp

puts "Enter letter to remove from word:"
letter = gets.chomp

puts "The resulting word is: \"" + word.gsub(letter, "") + "\""

easy164-5.rb

array = [1, 2, 3, 4, 5, 112]

sum = 0
array.each { |a| sum += a }

puts "The sum of the array is: " + sum.to_s

easy164-bonus.rb

array_of_numbers_to_sort = [17, 2, 14, 112, 3, 62, 13]

puts "Array to sort:"
print array_of_numbers_to_sort
puts

sequence_modified = true

while sequence_modified do
sequence_modified = false
i = 0
    while i < array_of_numbers_to_sort.length - 1 do
        if array_of_numbers_to_sort[i] > array_of_numbers_to_sort[i + 1]
            temp = array_of_numbers_to_sort[i + 1]
            array_of_numbers_to_sort[i + 1] = array_of_numbers_to_sort[i]
            array_of_numbers_to_sort[i] = temp
            sequence_modified = true
        end
        i += 1
    end
end

puts "Results of bubble sort:"
print array_of_numbers_to_sort
puts